$1.$What is the complexity of the given method as a function of the problem size n$?$ Show all

details of your analysis.

public static int count $($int n$)$

$\{$

if $($n$\%2==0)$

return n;

int i$=0$;

while $($i $>0)$

i$--$;

return i;

$\}$

$2.$ Write a pseudocode to print first n Fibonacci numbers. Analyze the time complexity of

your algorithm.

$3.$ Evaluate the time complexity of searching for an element in a linked list.