Please answer all my questions, even if will take as many post questions. The problem is in Artificial intelligence and DFS regard to a depth first search, BFS referred to breathe first search and UCS regard to uniform cost search.

Consider the following graph with start state S and goal state Z. The numbers on the arcs indicate the cost of traversing that arc. SE 1. Solve this problem using BFS, DFS, and UCS strategies. In each case, show the order in which nodes are added to the fringe as well as the generated tree and the solution path. Leftmost nodes are added before rightmost ones, Indicate if found solutions are optimal. Do not add repeated states. 2. Given the heuristic function h for which values are given in table below: Noden SFE1 C BAIGIZ a. Solve this problem using Greedy search. Show values of the evaluation function as well as the state of the fringe and the solution path. b. Solve this problem using A.Show values of the evaluation function as well as the state of the fringe and the solution path. c. Is h() admissible? Why