Write the missing code in the method that counts the number of odd integers in a single linked list of integers.

int FinalExam($($Node head

Node current =$=$ head;

int counter =0$=0$;

while(−$(-$

)$)$

return counter;

Note: ||$||$ means logical OR,$,$ && means logical AND

while($($current !=$!=$ null ||$||$ current.element %2==1)$\%2==1)$ O

counter++$++$;

current =$=$ current.next;

while($($currentl =$=$ null){$)\{$

if ($($current.$.$element %2==1)$\%2==1)$ W counter++$++$;

current =$=$ current.next; J

while($($current.$.$next !=$!=$ null)$)$

if ($($current.$.$element %2==1)$\%2==1)$

counter++$++$;

current =$=$ current.next;