Explain your answer

3. (8 points) Give a tight upper asymptotic bound for the following functions. Assume printing takes constant time. (a) (2 points) function (n) { for i1 to n do for i-1 to 100do Print("Hi there") (b) (2 points) function(n) { for i1 to n do for i -i to n do Print ("Hi there") (c) (2 points) function (n) while i>0 do i - floor(i/2) Print("Hi there") (d) (2 points) Bogus-Name (A) A. length if n =0 then return 0 else a = Bogus-Name (floor(n/4)) b-Bogus-Name (ceiling(n/4)) Search (A,a) // Search A for a Search(A,b) // Search A for b