what does the following code do? public int function(T e) Node temp = head; int var = 0; while (temp != null) { if(temp.Data e) { return var; } var = var+13; temp temp.Next } return -1; a. Find and delete a given element in the list O b. Find and return the given element in the list O c. Find and insert a new element in the list n d. Find and return the position of the given element in the list

6. the grade is under 20 which is outlier, remove it from the array list. 7. Print array list using System.out.println() 8. Use indexOf to print index of 80. 9. Use get function. 10. What is the difference between get and index of? 11. Print the values of the array list using Iterator class. 12.. Delete all the values of the array list using clear function. 13. Print all the values of the array after you execute clear using System.out.println(). what is the result of using clear function? 14. What is the shortcoming of using array List?

With Head node or not? statement is: if(p->rlink != first) p = p->rlink; O a. It is a Doubly linked list without Head node. O b. It is a Doubly linked list with Head node.