exercises for source code and help with exercisesplease visit java datastructures net reinforcement - draw representation of an initially empty array list after performing the following sequence of operationsadd( , )add( , )add( , )add( , )add( , )add( , )add( , )add( , - give justification of the running times shown in table for the methods of an array list implemented with (nonexpandingarray - give an adapter class to support the stack interface using the methods of the array list adt - redo the justification of proposition assuming that the the cost of growing the array from size to size is cyber-dollars how much should each push operation be charged to make the amortization workr- give pseudo-code descriptions of algorithms for performing the methods addbefore( , )addfirst( )and addlast(eof the node list adtassuming the list is implemented using doubly linked list - draw pictures illustrating each of the major steps in the algorithms given in the previous exercise - provide the details of an array implementation of the node list adtincluding how to perform the methods add before and addafter -