$2.$ Consider the following divide$-$and$-$conquer algorithm: float myFunc$($X$)\{$ n $=$ X$.$length; if $($n $==1)\{$ return X$[0]$; $\}//$ let X$1,$ X$2$ be arrays of size n$/2$ for $($i $=0$; i $!=($n$/2)-1$; i$++)\{$ X$1[$i$]=$ X$[$i$]$; X$2[$i$]=$ X$[$n$/2+$ i$]$; $\}$ for $($i $=0$; i $!=($n$/2)-1$; i$++)\{$ for $($j $=0$; j $!=($n$/2)-1$; j$++)\{$ if $($X$1[$i$]==$ X$2[$j$])\{$ X$2[$j$]=0$; $\}\}\}$ r$1=$ myFunc$($X$1)$; r$2=$ myFunc$($X$2)$; return max$($r$1,$ r$2)$; $\}($a$)$ Obtain a recurrence relation for the algorithm$$s basic operation count. $($b$)$ Solve the recurrence relation found in part $($a$)$ t