$(6$ points$)$ i$)$ Represent the following graph using adjacency lists. ii$)$ Run DFS and show each node's discover time and finish time. When running DFS$,$ you must consider vertices in increasing alphabetical order when considering a vertex's neighbors and starting a new DFT$.$