1.Draw the adjacency list for the following graph:

2.Briefly explain the differences between dense and sparse graphs. When is if more feasible to use a linked representation for a graph over an adjacency matrix. Also, justify your answer using a mathematical definitions for sparse and dense graphs.

Overview. Provide the solutions for the problems in this assignment within a single Mic Word document. However, a Power Point file or scanned handwritten drawing for Problem 1(b) s fine. Remember to include your name and course number within all documents and files that ou submit. Problem 1. [4 points] Sorting: Read the assigned chapter and the notes for Week 7 located in the earning Activities area, and then do the following problems: (a) [2 points]. Both the Mergesort and the Quicksort algorithms will sort a list by portioning the list. Briefly explain how Mergesort differs from Quicksort when partitioning the list. (b) [2 points] What is the big-O of the function: template void heapsort (vector