Q1-Q4. For a given graph G1=[V, E) in the figure, perform the given tasks. In DFS and BFS, a weight of edge is not considered and a priority for selection is given to the vertex whose alphabetic order is the lower: e.g.) s <w<y in DFS or in BFS from the starting vertex q. 12 t 6 9 3 11 S 5 2 2 V W X 4 Ꮓ 5 9 r 5 И 3 y