Write a non-recursive method "count Doubles", which takes as parameters an IntNode myList and returns the number of nodes that are twice as big as their immediate predecessors in myList. For example, in the following linked list, nodes 6, 12, and 44 are twice as big as 3, 6, and 22, respectively, so the method should return 3 for this list. myList 8 3 6 public class IntNode } 12 private int m_data; private IntNode m_link; 5 22 public IntNode (int data, IntNode link) { m data = data; m link = link; 44 public int getInfo() {return m_data; } public IntNode getLink () { return m_link; } public int count Doubles (IntNode myList) { 17 // type your implementation in the text box below // You will get a zero if the method is implemented in a recursive way.

Write program in java

JAVA plese Implement the indexOf method in the LinkedIntegerList class      public int indexOf(int value);        /**     * Returns whether the given value exists in the list.     * @param value - value to be searched.     * @return true if specified value is present in the list, false otherwise.     */ }     public static void main(String[] args) {        // TODO Auto-generated method stub        SimpleIntegerListADT myList = null;         System.out.println(myList);        for(int i=2; i<8; i+=2) {            myList.add(i);        } System.out.println(myList.indexOf(44));

Write a recursive instance method isSorted that takes a Link parameter and determines whether a linked list is sorted in descending order or not (return a boolean value).