What requirement is placed on an array, so that binary search may be used to locate an entry? 1.The array must be sorted. 2.The array must have at least 2 entries. 3.The array’s size must be a power...

int Mystery( int x){

     int count = 0;

     Node current = head;

     while(current != null){

            if( current.element == x)

                count++;

       current = current.next;

       }

return current;

}

int  Mystery( int x){

     int count = 0;

     Node current = head;

     while(current != null){

            if( current.element == x)

                count++;

       current = current.next;

       }

return count;

}

int Mystery( int x){

     int count = 0;

     Node current = head;

     while(current.next != null){

            if( current.element == x)

                count++;

       current = current.next;

       }

return count;

}

Root node

Leaf node

Inner node

None of the given options