Question # 1: (LOs based NARS 2018: A3; ABET OUTCOME: 1, 2) (10 Marks) (a) Given the following city map shown in the figure below, where "a" is the initial state and "t" is the destination state: State Heuristic h(n) 100 80 120 ed Maritia i 90 70 145 NO d 80 reda e 300 110 120 123 125 260 235 55 0 h 60 250 9 h g elence So to the way Apply A search algorithm to find the Minimum-cost navigation path from start state "d" to destination state "M", use a tracing table to show all your iteration steps. Then calculate the total path cost and state the Time complexity of A* search. College of (b) Given the following Multi-Layer neural network (2-2-1 network). Apply only one iteration of the Back-propagation learning rule where a learning rate is set to 0.5. Calculate the Final Error E using Euclidean distance (where Target value T is set to 1). p1 and p2 are: (1 1), and weight matrix of 1 layer as shown in figure below: Log Sigmoid transfer function: SDH pouze venputer Vapaat 1+en E4Zaring pla " 7 pencapaian LI input d'=logsig('p+b) d=Linear/w'd'+b)