Consider the following travel scenario and then answer the two questions at the bottom You are flying from Ireland to Switzerland but need to change flights in London. The incoming plane will land at London Luton airport (LTN), and you must transfer by train to London Gatwick (LGW) in order to catch your connecting flight. The graph below shows all the London airports (nodes), the train travel connections between them (edges), as well as the related travel cost (numbers). * 35 LTN 10 20 STN LHR LCY 20 30 70 60 LGW A heuristic has estimated the distances of the airports from LGW as follows: h(LTN)=60 H(LHR)-50 H(LCY)-20 h(STN)-60 TN)=60 Given the heuristic values above, state whether the heuristic is admissible for this problem and explain how this affects the algorithm's perf 14 marks) What is the best route that the A algorithm will find for this problem when implemented as tree search? (4 marks) CY)-20 TN)=60 Given the heuristic values above, state whether the heuristic is consistent for this problem and explain how this affects the algorithm's performance. (1 What is the best route that an A* algorithm will find for this problem when implemented as graph search? (4 marks)