help me

Questions 1 and 2 refer to this graph: A B C D E . F G H Note: This is the same graph from the Chapter 11 homework assignment, but on the final exam we are considering vertex E to be the root of the spanning tree. 1 -9 Using alphabetical ordering with vertex E as the root, draw a spanning tree for this graph by using a depth-first search. 2-@)Using alphabetical ordering with vertex E as the root, draw a spanning tree for this graph by using a breadth-first search