Question 4 (10 marks) Consider the class SinglyLinkedList outlined below public class SinglyLinkedList implements List t private static class Node I private Boolean value; private Node next; private NodeBolean value, Node next ( this value value; this next next; private Node head public boolean sEmpty ) return head = null; /I class continues after that We want to add the method andO to the class SinglyLinkedList. The method andO is a recursive method that returns true if and only if all the elements of the list instance are true. The bchaviour of the method is undefined if the list is empty For example, the code below prints true then false SinglyLinkedList test new SinglyLinkedList ); test.add (true) test add (true); test add (true); System. out. println (test and )): I prints "rue" test add (false): test add (true); System. out. println (test and )): I prints "false" Provide the recursive implementation of the method in the following box. Warning: make sure that your implementation is as efficient as possible. Two marks will be removed for an inefficient implementation