Asap

Create an ArraylistReview class with one generic type to do the following . Creates an array list filled with the generic type of the ArraylListReview class, and inserts new elements into the specified location index-i in the list. (5 points) Create a method inside the class to implement the calculation of Fibonacci numbers. Use System.nanoTime to find out how much time it takes to get fab(50). Create a method inside the class to check if an array list is a palindrome, assuming each element in the array list is one character. (5 points) Implement insertionsort either recursively or non-recursively. (5 points) Implement mergeSort using a list and recursion. (5 points) Use System.nanoTime() to find out the speed of your program. (required for each step) Bonus Given any integer, print an English phrase that describes the integer (e.g. "One Thousand, Two Hundred Thirty Four"). An ArrayList must be used in your program