Based on the following graph a. Use graph search (i.e., avoid repeated states) to draw the first three levels of the full search tree with root node given by A b. Use the breadth first tree search (BFS) to give an order of nodes being visited c. Use the branching factor b and the the depth d of goal state to evaluate time and space complexity for general breadth first search. d. If the step-cost for a search problem is NOT constant, is breadth first search always optimal? Is BFS graph search optimal? e. If we assume the constant step-cost, is BFS tree search optimal? Is BFS graph search optimal