(10 points) The following method (reversel)is not correctly implem the errouneous statements so that the mathods can iteratively Assume that the method header is correct. (Hint: There are five logical/syntax errors.) 6. ented. Correct only reverse a singly linked list. (Your Correction) public void reverse Node prev-head; Node curr head: while (curr nul1) Node next curr.getNext o curr.getNext (prev)z curr previ curr- next: curr previ (10 points) Fill in the blanks so that the following method can recursively reverse a singly linked list. Note that you also need to implement reverseRecursivel) which is a helper method that is called in a driver class like alist.reverseRecursivel). 7. public Node reverse (Node prev, Node curr) if (currnul1) return Node next = curr.getNext(); return public void reverseRecursive ()