Capital and Revenue Expenditures On February 13, Scanlon Co. paid $3,400 to repair the transmission on one of its delivery vans. In addition, Scanlon paid $20 to install a GPS system in its van. Journalize the entries for the transmission. February 13? It should be two answers, Cr/Dr Journalize the entry for GPS system expenditures. February 13? It should be two answers, Cr/Dr Solution Account Debit Credit Accumulated Depreciation- Delivery Van $3400 Cash $3400 To record the repair of transmission on delivery vans.(Revenue Expenditure Delivery Van $20 Cash $20 (To record capital expenditure on Van (installing GPS).

1. Consider L = {a^nb^2nc^P | p 0}. Prove L is not a context-free language.
Solution
#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
/*
* Node Declaration
*/
struct node
*start, *last;
int counter = 0;
/*
* category Declaration
*/
class double_clist
begin = NULL;
last = NULL;
}
};
/*
* Main: Contains Menu
*/
int main()
worker = new(struct node);
temp->info = value;
temp->next = NULL;
temp->prev = NULL;
come back temp;
}
/*
*INSERTS component AT starting

2. */
void double_clist::insert_begin()
{
int value;
cout<<endl<<"Enter the component to be inserted: ";
cin>>value;
struct node *temp;
temporary worker = create_node(value);
if (start == last && begin == NULL)
{
cout<<"Element inserted in empty list"<<endl;
begin = last = temp;
start->next = last->next = NULL;
start->prev = last->prev = NULL;
}
else
{
temp->next = start;
start->prev = temp;
begin = temp;
start->prev = last;
last->next = start;
cout<<"Element inserted"<<endl;
}
}
/*
*INSERTS ELEMNET eventually
*/
void double_clist::insert_last()
{
int value;
cout<<endl<<"Enter the component to be inserted: ";
cin>>value;
struct node *temp;
temporary worker = create_node(value);

3. if (start == last && begin == NULL)
{
cout<<"Element inserted in empty list"<<endl;
begin = last = temp;
start->next = last->next = NULL;
start->prev = last->prev = NULL;
}
else
}
/*
*INSERTS component AT POSITION
*/
void double_clist::insert_pos()
{
int value, pos, i;
cout<<endl<<"Enter the component to be inserted: ";
cin>>value;
cout<<endl<<"Enter the postion of component inserted: ";
cin>>pos;
struct node *temp, *s, *ptr;
temporary worker = create_node(value);
if (start == last && begin == NULL)
{
if (pos == 1)
{
begin = last = temp;
start->next = last->next = NULL;
start->prev = last->prev = NULL;
}
else
ptr->next = s->next;
s->next->prev = ptr;
if (pos == counter)

4. counter--;
free(s);
cout<<"Element Deleted"<<endl;
}
/*
* Update worth of a selected node
*/
void double_clist::update()
{
int value, i, pos;
if (start == last && begin == NULL)
s->info = value;
cout<<"Node Updated"<<endl;
}
/*
* Search component within the list
*/
void double_clist::search()
zero, value, i;
bool flag = false;
struct node *s;
if (start == last && begin == NULL)