1. This is the map of UUM Main Campus (Sintok) to show reated distances (in kilometres) from the Main Gate to the Varsity Mall. Anjung Tanu Main Gate -[o. 11 (2.6]. INASIS Tradowinde [1.6] [1] [0.3]...

First, convert this labelled directed graph into a search tree representation. Next, you need to define your heuristic function for each node. Later, find the searching space from the Main Gate (start) to the Varsity Mall (goal) for the following search methods:
a) Depth-First Search
b) Breadth-First Search
c) Depth Limited Search (L = 3)
d) Uniform Cost Search
e) Best First (Greedy) Search
f) A* Algorithm

Extracted text: 1. This is the map of UUM Main Campus (Sintok) to show reated distances (in kilometres) from the Main Gate to the Varsity Mall. Anjung Tanu Main Gate -[o. 11 (2.6]. INASIS Tradowinde [1.6] [1] [0.3] [0.6) TISSA t0.3] Varaity Mocque Mall [0.6) Library -[0.6) )10.8)- [0.2] [0.8] [1] [0.6] Great -[0.1] Hall soc Health [0.6] INASIS Centre [1.6] Sport Maybank Centre [0.3]-