Elanor and Dash are scouting locations for opening a new store. They need to keep the scouting of and opening location secret from their competitors to maintain an competitive advantage. This include the locations of the stores and the names of the roads they travel. They both agree that there are a number of locations that they should visit but they in are in disagreement about how they should visit them. Elanor believes they should use a route, starting from their flagship store, such that they visit each site once and only once before returning to their flagship store. Dash, on the other hand, thinks they need to be more careful. He recommends that they choose a route such that they travel along each road once and only once to see if it is suitable for their new store. He does not mind if they have to pass through a location more than once as long they only travel along each road once and that they begin and end the route at their flagship store . Figure 3 shows the potential store locations, A. B. C. D. .... H and their flagship store at X. The possible roads that they could use are code-named a, b, c. . . ., I to ensure secrecy. b B d D E F T G H XFigure 3: A map of the proposed store locations A, B. C..... H and the flagship store at X. (a) Determine the route (if possible) that would satisfy Elanor's requirements. Draw this route. What type of path is this route? (b) Determine the route (if possible) that would satisfy Dash's requirements. Draw this route. What type of path is this route