Question 6 (16 marks) 1) Determine the order in which a Pre-order, an In-order and a Post-order traversal visits the vertices of the given ordered rooted tree (Figure 2). (8 marks) 2) Use depth-first search to produce a spanning tree for the given simple graph (Figure 3). Choose 'a' as the root of this spanning tree and assume that the vertices are ordered alphabetically. (8 marks) b d b0 h w 8 n h k . m oc 9 1 Z m n o Figure 2 Figure 3