Implement a method called toArrayO that converts a LinkedList to an array. The output should be the elements of the LinkedList and the elements of an array. Extend the program and reverse the printed array.
2. Implement a method called ContainsElementO that checks whether a specified element is contained within a LinkedList or not; if the specified element is found in the LinkedList, output TRUE else FALSE.
3. Implement a method called WithinRangeO for an ArrayList that removes all the elements within the specified range; the starting point of the range and the ending point of the range should be specified to indicate where the elements will be removed. The initial elements before removing and after removing should be both printed.
4. Write the cases for all the methods, and draw a diagram for each method to depict how the methods are being implemented.
N.B: Create your own LinkedList or ArrayList with 10 elements (you can use any type of your choosing). Use the LinkedList/ArrayList programs shared on eFundi and used for your lectures to implement all three methods.