Please solve all the three questions!! Send me answer within 10 min!! I will rate you good for sure!! 1. Both informed and uninformed search strategies are commonly used in problem-solving applications. However, they have distinct properties that determine whenit may be advisable to prefer one over the other.Consider the search problem below, where A is the initial state, and D is the goalstate. The optimal path is that with the lowest accumulated path cost.A10B402080C30Da) Uniform-Cost-Search (UCS) is an algorithm that uses the path cost todetermine which nodes to explore in sequence.i) Assuming a tree-search implementation, give the sequence of nodes inwhich UCS is going to explore the tree.ii) Did UCS find the optimal solution for this problem?iii) Given positive path cost for any given search problem, is UCSguaranteed to always find an optimal solution? Explain.

Uninformed Search:Uninformed search strategies, also known as blind search strategies, operate…

A 10 B 40 20 80 30 D a) Uniform-Cost-Search (UCS) is an algorithm that uses the path cost to determine which nodes to explore in sequence. i) Assuming a tree-search implementation, give the sequence of nodes in which UCS is going to explore the tree. ii) Did UCS find the optimal solution for this problem? iii) Given positive path cost for any given search problem, is UCS guaranteed to always find an optimal solution? Explain.

A 10 B 40 20 80 30 D a) Uniform-Cost-Search (UCS) is an algorithm that uses the path cost to determine which nodes to explore in sequence. i) Assuming a tree-search implementation, give the sequence of nodes in which UCS is going to explore the tree. ii) Did UCS find the optimal solution for this problem? iii) Given positive path cost for any given search problem, is UCS guaranteed to always find an optimal solution? Explain.