There are two algorithms A and B for solving the same problem.

Algorithm A has a worst$-$case time complexity

that satisfies the recurrence relation

$,$ where

is the input size.

Algorithm B has a worst$-$case time complexity

that satisfies the recurrence relation

$,$ where

is the input size and

is a positive integer.

Answer the following questions.

In the dropdown lists, $\backslash$Theta stands for

$,\backslash$log$\_$b a stands for

$,$ and n$^$x stands for

$.$

$($a$)$ Which case of the Master method applies when solving for

$?$