Problem $1($Handwritten only$)$

$[10$ pts$]$ Consider the following function and explain what is its Big O$?$ Detailed explanations

are required and simply put your final answer will get $0$ point.

Problem $2($Handwritten only$)$

$[20$ pts$]$ Draw a diagram which represents a top$-$down view of the recursive merge sort algorithm

used to sort a $7-$element integer array $35,42,7,15,36,10,82.$ See the following example for the

expected diagram: