0. For Problems 3 and 4, the Node class is declared as:

    class Node { int value; 

   Node next;

    // constructors } 

   3. (5 pts) Implement the method int numberPositive(Node head) that counts the number of positive integers in a linked list of integers recursively. Assume the linked list is reference by head. No global variables or variables out of the methods scope are allowed.

   4. (5 pts) Implement the method Node search(Node head, int key) that returns the reference to the node with the value key in a linked list of distinct integers recursively. Assume the linked list is reference by head. The method returns null if the search fails. No global variables or variables out of the methods scope are allowed.

For Problems 3 and 4, the Node class is declared as: class Node int value; Node next; // constructors } 3. (5 pts) Implement the method int number Positive(Node head) that counts the number of positive integers in a linked list of integers recursively. Assume the linked list is reference by head. No global variables or variables out of the method's scope are allowed. 4. (5 pts) Implement the method Node search (Node head, int key) that returns the reference to the node with the value key in a linked list of distinct integers recursively. Assume the linked list is reference by head. The method returns null if the search fails. No global variables or variables out of the method's scope are allowed