Assume g $($n$)$ basic operations for partitioning and combining and no basic

operations for an instance of size $1.$

$($a$)$ Write a recurrence equation T$($n$)$ for the number of basic operations needed to

solve P when the input size is n$.$

$($b$)$ What is the solution to this recurrence equation if g $($n$)$ in $\backslash$Theta $($n$)?($Proof is not

required.$)$ void solve