Please write this in Java and include a main method.

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 Linked List class, write a class in Java to implement the MyList data structure and that take O(1) time per operation. Note: The MyList class signature is: public class MyList MyList . -> void myPush(AnyType x) {-- .} AnyType myPop) t. . -1 void mylnject(AnyType x) {.)