Problem #2: (20 points) A MyList is a data structure consisting of a list of items, on which the following operations are possible: myPush(x): Insert item x on the front end of the MyList. myPop): Remove the front item from the MyList and return it. myInject(x): Insert item x on the rear end of the MyList. Using the LinkedList class, write a class in Java to implement the MyList data structure and that take 0(1) time per operation. Note: The MyList class signature is: public class MyList MyList() {.) void myPush(AnyType x) f. . .) AnyType myPop() . . ^ void myInject(AnyType x) f. . .)