Write the following LinkedList functions recursively. Assume the
  following LinkedList setup

  ,----
  | Class LinkedList{
  |    Node head; //head of the list
  | 
  |    private class Node{
  |        int data; //stores integeres
  |        Node next; //next pointer
  |    }
  | }
  `----

  1. 
     ,----
     | //returns the Node in the list storing the first even value or null if
     | //there are no even values in the list
     | Node firstEven();
     `----

  2. 
     ,----
     | //returns true if the list contains an odd value, false otherewise
     | boolean hasOdd();
     `----