Problem $1(20$ points$).$ Print the BFS and DFS $($the sequences of letters being visited over the course of the search$)$ that starts from the vertex $d$ of the following graph. If a vertex has multiple next$-$hops, then search the next$-$hops in the order of their vertical coordinates from the lower ones to the higher ones. $($Note that the textbook's DFS algorithm tries all vertices as the starting vertex, but here you only need to show the print of the DFS that starts from the vertex $d).$