Quickly Please

3. [10+10+20] a) [10] Apply UCS (Uniform Cost Search) algorithm on the graph given in Figure 1 to find an optimal path from S G. Compute the selected path after each step of the algorithm. b) [10] Apply Best First Search (Uniform Cost Search) algorithm on the graph given in Figure 1 to find a path from S G. Compute the selected path after each step of the algorithm. The heuristic values h(n) (i.e. cost from node n to goal node G ) are provided in the array given below in Table 2 . Artificial and Computational Intelligence Page 2 of 2 Figure 1: Graph for Search Algorithms Table 2: Heuristics values c) [20] Apply the UCS algorithm with modified cumulative cost f(n) for reach a node n on the graph given in Figure 1 where f(n)=g(n)+h(n). The function g(n) computes the cost of reaching node n from the start node following a path and h(n) represents the heuristic cost from node n to the goal node G. Discuss the algorithm in terms of time complexity; space complexity, completeness and quality of the solution