Backward Multistage Graph Algorithm:

Explain multistage graph with example. Write multistage graph algorithm to forward approach

Dynamic Programming: Warshall’s algorithmApply Warshall’s algorithm to find the transitive closure of the digraph defined by thefollowing adjacency matrix:[[0,0,0,1],[0,0,1,0],[0,0,0,1],[0,0,0,0]]

(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]

Prim’s Algorithm for finding the Minimum Spanning Tree of a graph is a kind of a _______ans.forward methodgreedy methoddivide and conquer methodback tracking method Previous Marked for Review Next

Use Warshall's algorithm to compute the transitive closure of the graph with the following adjacency matrix: 0 0 1 1 1 0 0 1 0 0 0 0 0 1 1 0 Choose the correct values for the unknown variables after each of the four steps for the algorithm. After the first step: 0 0 1 1 1 a1 b1 1 0 0 0 0 c1 1 1 0 [ Select ] After the second step: 0 0 1 1 1 a2 b2 1 0 0 0 0 c2 1 1 1 [ Select ] After the third step: 0 0 1 1 1 a3 b3 1 0 0 0 0 c3 1 1 1 [ Select ] After the fourth and final step: 1 1 1 1 1 a4 b4 1 0 0 0 0 c4 1 1 1 [ Select ]