$2\mathrm{.}1.$ Create a Python program that generates a list of $10000$ random numbers between $1$ and $1000.$ Your program must either implement a merge sort algorithm or a quick sort algorithm to sort the list. Display the unsorted and sorted lists, as well as the time $($in milliseconds$)$ taken to complete the sort.

$(10$ Marks$)$

$2\mathrm{.}2.$ Given the following table which describes the composition of a graph:

$\backslash$table$[[$Vertex$,$Adjacent vertices$],[1,(2,3,4)$