Giving an array:

A $=[1,-3,5,4,90,11,15,13,21,99,87,-10,3,7,19,71,60,55,18,100]$

i$)$ Use binary search algorithm to search for $-3$

ii$)$ Use binary search algorithm to search for $13$

iii$)$ How many steps were needed for step $($i$)$ above?

iv$)$ How many steps were needed for step $($ii$)$ above?

v$)$ How many steps would have been required for the same operations using linear

search in $($i$)$ and $($ii$)$ above?