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

Algorithm A has a worst$-$case time complexity Ta $($n$)$ that satisfies the recurrence relation Ta $($n$)=8$ Ta $($n$/2)+$ n$*,$ where n is the input size.

Algorithm B has a worst$-$case time complexity TB $($n$)$ that satisfies the recurrence relation Te$($n$)=$ a $$ Tb$($n$/4)+100$ n$2,$ where n is the input size and a is a positive integer.

Answer the following questions.

In the dropdown lists, $\backslash$Theta stands for O$,$ Vog$\_$b a stands for log$,$ a$,$ and n$^$x stands for n$*$

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