Give a big-O and big-Theta estimate for the number of comparisons in the following algorithms. Please explain your reasoning and show your work. Write your answer in the form O(n^d)

a) function A (n: positive integers)

count = 0

for i = 1 to n

for j = 1 to n²

if f(i) = g(j)

count = count + 1

return count

b) T (n: positive integers)

if n < 3

return n

else

return T(n/3) + T(n/3) + T(n/3) + T(n/3)