Tasks:

$1.$ Detailed Visualization of Sorting Processes:

$-$ For the given array, manually show the result of each step or iteration for the following

algorithm, without implementing them in code.

$-$ The array to be sorted in increasing order:

Product Id $111302516297671511848923$

$-$ Clearly show all iteration when applying the following sorting algorithm on Product ID$.$

$$ Merge Sort $($all iterations$)$

$2.$ Sorting Algorithm Simulation Program:

$-$ Write a program in Python$/$C$++($or the language of your choice$)$ that simulates the Merge

Sort Algorithm. Please incorporate sound effects for swaps.

$-$ The program must accept an array of n numbers, then execute the sort algorithm and print

out each step.

Deliverables: $(10$ Marks$)$

$1.$ Introduction:

$-$ Provide context and objectives for the detailed sorting algorithm visualization.

$2.$ Detailed Visualization $(4+2$ Marks$)$:

$-$ Documentation that includes detailed illustrations showing the output for each iteration of

the sorting process for the specified algorithm.

$-$ Write a comparison table showing the best and worst$-$case time complexity Analysis

$3.$ Code Implementation $(4$ Marks$)$:

$-$ Code snipper of the running merge sort program. Submit the complete program for merge

sort, ensuring it includes all required features and a GitHub repository link for your code.

$4.$ Conclusion:

$-$ Summarize the detailed findings, learning outcomes, and any conclusions drawn from the

visualization and implementation of the sorting algorithms.