Matching time complexities closed

Question

Answer 1

Am getting option b.

Answer 2

A)  T(n) = T(n - 1) + 1/n  => 1+ 1/2 + 1/3+  ...+ 1/n = log(n)   so A matches with 4

D) T(n) = 4T(n/2) + n² root(2) =>  solve this using Master's theorem by taking a=4 , b=2 , k=2 , p= 0 you will get O(n² log(n) )

so D matches with 2

And For "B" as well you can solve it by master theorem by taking a=2 . b=2 , k=1 and p= -1  you will get O( n loglog(n) )

and in the option given above " Opition B" matches

so answer is B