Consider the following binary search algorithm $($a classic divide and conquer algorithm$)$ that searches for a value X in a sorted N$-$element array A$[]$ and returns the index of matched entry. Assuming that the number of cores on a multi$-$core processor to run BinarySearch is much smaller than N$,$ discuss the speedup possibilities. How will your answer change if BinarySearch it rewritten as a recursive function? $(5$ points$)$ BinarySearch$($A$[0..$N$1],$ X$)\{$ low $=0$ high $=$ N $1$ while $($low $<=$ high$)\{$ mid $=($low $+$ high$)/2$ if $($A$[$mid$]>$X$)$ high $=$ mid $1$ else if $($A$[$mid$]$