Please show all of your steps! thank you in advance

Please show all of your steps! Thank you in advance. 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 A) Draw the portion of the state space (in tree format) for values 1 to 64. Part B) 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