12. The following implementations of the method reverse are intended to reverse the order of the elements in a LinkedList I. public static void reverse (LinkedListcSomeType> alist) while (aList.size 0>0) while (temp.size 0> 0) LinkedList temp new LinkedList0: temp.addLast (alist.removeFirst 0) alist.addFirst (temp.removeFirst (0 Il. public static void reverse (LinkedList alist) while (al ist size () >0) while (ltemp.isEmpty 0) QueuecSomeType> temp new LinkedList (: temp.add (aList.removeFirst 0) aList.addFirst (temp.remove O) 01: public static void reverse (LinkedList alist) Stack temp new Stack(: IIL. while (aListsize (>0) temp.push (aList.removeLast O): while (Itemp.isEmpty0) aList.addFirst (temp.pop 0) Which of the choices above perform the intended task successfully? Why? a. Ionly b. Il only c. Ill only d. Il and Ill only e. I, Il, and