Question $1$

Given the following array$[4,2,6,5,3,9].$ Answer the questions below:

$1\mathrm{.}1$By the mean of a diagrams show how the merge sort algorithm will perform an ascending sorting of the above array.

$(12$ marks$)$

$1\mathrm{.}2$Implement a java program of a merge sort algorithm to test the efficiency of the sorting using the given array.

$(5$ marks$)$

$1\mathrm{.}3$Determine the big$-$O computation of the merge sort.

$(5$ marks$)$

$1\mathrm{.}4$Critically analyse the performance of the merge sort algorithm $$ implemented for sorting the above array.$$

$(3$ marks$)$