You are developing a navigation system for a self-driving car. The system needs to find the shortest path from the car's current location to a specified destination on a map. The map is represented as a graph, where nodes represent intersections and edges represent roads connecting the intersections. Each road has a length associated with it. You decide to use the Best-First Search algorithm with a heuristic function that estimates the straight-line distance between two intersections.QuestionWhat would be the most appropriate criterion for selecting the next node to expand in the Best-First Search algorithm for the self-driving car navigation system?a)The depth of the nodeb)The straight-line distance to the destination from the nodec)The breadth of the noded)The cost associated with the node

Which search method will expand the node that is closest to the goal?ans.A* searchGreedy best-first searchNone of the mentionedBest-first search Previous Marked for Review Next

You are given a state graph with link costs and consistent heuristic values on the  states. The running time of the algorithm should be a function of the number of states in the graph and the algorithm should guarantee that the path with shortest path cost is found.Choose the most efficient search method that meets the criteria indicated above.  Explain your choice.

(a) You will investigate various search algorithms for the graph in figure 1. Edges arelabeled with their costs, and heuristic values h for states are labeled next to thestates. S is the start state, and G is the goal state. For each of the following graphsearch strategies, work out the order in which states are expanded, the path returnedby graph search, the path cost, as well as the states that are not expanded. In allsearch algorithms, assume ties are broken in alphabetical order. Draw search tree foreach search strategy to illustrate your answer.Figure 1: Search graph 12 of 5(i) Depth first search [ 3 marks](ii) Breadth First search [ 3 marks](iii) Uniform cost Search [ 4 marks](iv) A* search [4 marks](v) Greedy Search [ 2 marks](b) The heuristic values for the graph in figure 2 are not correct. For which single state (S,A, B, C, D, or G) could you change the heuristic value to make everything admissibleand consistent? What range of values are possible to make this correction? [ 4marks]Figure 2: Search graph 2Question 3(a) Explain the role probability play in Artificial Intelligence. [2 marks](b) Covid-19, Maleria and Paralysis diseases cases have been reported in Makerere Uni-versity. The Ministry of Healthy has sent a team of experts to perform a diseasediagnosis to patients suspected being suffering from the diseases within Makerereand report on their rampage as soon as possible. But as they try to perform thedisease diagnostics, they discover that these diseases exhibit similar symptoms whichmakes the diagnosis process much more complicated, thus delaying the results. Inorder to reduce on the time delay in the provision of diagnostics results in the nearfuture, they have proposed using a machine learning diagnosis system and you havebeen approached to assist in the development of such systems. Using the knowledgeof Artificial intelligence and probability theory, discuss the steps you would followin developing such a system. You should clearly state the assumptions and relevantexamples for full marks. [18 marks]

Which algorithm is used to find the shortest path in a graph?Question 16Select one:Bellman-Ford algorithmTopological SortFloyd-Warshall algorithmDijkstra's Algorithm

The time complexity of the Best-first search depends on..........................................a)the number of nodes in the graph.b)the branching factor of the graph.c)the depth of the solution.d)the heuristic function used.