This problem has been solved!
see the answer
suppose a java method receives a list and reverses the order of the items it contains by removing each item from the front of

the list, adding each item to a stack, and then removing the items from the stack and inserting each item to the end of the list.

what is the expected big-o running time if:

a. if an arraylist is passed. explain your answer.
b. if a linkedlist is passed. explain your answer.

Function name: poly parameters: int returns: int description: a polynomial of degree n with coefficients a0,a1,a2,a3, . . ,an is the function p(x) = a0+a1x+a2x2+a3 ∗ x3+ . . +an ∗ xn this function can be evaluated at different values of x. for example, if: p(x) = 1+2x+ x2, then p(2) = 1+2 ∗ 2+22 = 9. if p(x) = 1+x2+x4, then p(2) = 21 and p(3) = 91. write a function poly() that takes as input a list of coefficients a0, a1, a2, a3, . . , an of a polynomial p(x) and a value x. the function will return poly(x), which is the value of the polynomial when evaluated at x.