5.) Consider the following graph: 2 (12) 1 18 18 (18) 8 42 (14) (30 2 a.) Given that child nodes are visited in non-decreasing order by their values, provide the ordering of node visits produced by breadth-first search. b.) Given that child nodes are visited in non-decreasing order by their values, provide the ordering of node visits produced by depth-first search.