Question $2$ options:

Given array A $=<23,10,8,12,36,17,5,30>,$ perform Merge$-$Sort$($A$,0,7)$ to sort it into ascending order.

$(1)$ How many recursive calls will be made to Merge$-$Sort in total, including the initial call Merge$-$Sort$($A$,0,7)?$

$(2)$ How many calls will be made to the Merge procedure in total?