Please show all of your steps! Thank you in advance.

Please show all of your steps! Thank you in advance. 1)- Please Consider a state space where the start state is a node with number 1. Each node has three successors with value 4k-2, 4k-1, and 4k, where k is the value of the parent node. Part 1: draw the portion of the state space (in tree format) for values 1 to 64. Part 2: suppose the goal state is 43, list the order in which nodes will be visited for breadth-first search, depth-first search, depth-limited search with limit 3, and iterative deepening search. 2)- Please assume there are two agents (Red and Blue) playing against each other. and the state-space is provided by the tree you derived in the previous question. The values in each node are the performance measures. Assuming player Blue starts first: Part A)- perform a MiniMax search to determine what moves Blue should make provided both players play optimally. Report the path and display all the scores for all the nodes after the search is complete. Part B) perform alpha-beta pruning. Report which nodes will be pruned. Please show all of your steps! Thank you in advance. 1)- Please Consider a state space where the start state is a node with number 1. Each node has three successors with value 4k-2, 4k-1, and 4k, where k is the value of the parent node. Part 1: draw the portion of the state space (in tree format) for values 1 to 64. Part 2: suppose the goal state is 43, list the order in which nodes will be visited for breadth-first search, depth-first search, depth-limited search with limit 3, and iterative deepening search. 2)- Please assume there are two agents (Red and Blue) playing against each other. and the state-space is provided by the tree you derived in the previous question. The values in each node are the performance measures. Assuming player Blue starts first: Part A)- perform a MiniMax search to determine what moves Blue should make provided both players play optimally. Report the path and display all the scores for all the nodes after the search is complete. Part B) perform alpha-beta pruning. Report which nodes will be pruned