3) [10 pts] In measuring "Problem Solving Performance answer the following 99 questions? a If an algorithm always finds a solution in a graph, what is this property called? b) If an algorithm always finds the best solution in a graph, what is this property called? c) Why are time and space complexity useful as metrics for graph search