Problem is in a picture below. Please help asap, limited time.

3) Adding to the end of a Singly Linked List with a first reference only 4) Adding to the end of an ArrayList where you do not have to reallocate 5) Adding to the end of an Array List where you do have to reallocate. 6) Searching though an Array for a given value 7) Deleting the first element in an ArrayList_ 8) Deleting the first element if a linked list 9) Adding to the front of an ArrayList 10) Adding to the front of a Linked List_ 11) What is the running time be for using selection sort? 12) If you sort 100 elements using selectionsort, how many comparisons would there be 13) If you were to sort 100 elements using an inefficient bubblesort, how many comparisons would there be 14) If you were to sort 100 elements using an efficient bubblesort, how many comparisons would there be? 15) Code the method to sort the following array in increasing order using selction sort public static sort (int[]array) { }