Khalid wants to go from Dammam to Abha using his car. The map shown below details the roads connecting cities that Khalid can pass through to reach his goal. Madinah Jeddah Riyadh Dammam Makkah a. Abha Let us define a tree-branch as a path that starts from the root of the tree to a unique leaf. Draw a tree that shows all paths Khalid can take to go from Dammam to Abha. (Note that a tree structure mandates that the same node cannot appear in a branch more than once). b. What is the depth of the constructed tree? c. In a tree structure, the branching factor of a node is defined as the number of edges between a node and its children. Identify the highest branching factor in the tree. d. Omar claims that if the number of cities visited in a path that is chosen by Khalid is equivalent to the tree depth, Khalid will always follow the shortest path. Do you agree with Omar's claim? Explain why? e. When will Omar claim be true?