I need help with this question please, thank you for the help and taking your time to help me :) 2.1. Consider a state space where the start state is number 1 and each state k has two successors: numbers 2k (left child) and 2k + 1 (right child). (a) Draw the portion of the state space for states 1 to 15. (b) Suppose the goal state is 11. List the steps to follow the following algorithms: (I) BFS (II) DFS (III) UCS (Suppose the cost from parent node to left child node is 1, from parent to right child node is 2) 2.2. Implement the BFS algorithm with the data in assignment 2.1 (start 1, goal 11) in the programming language you are comfortable with. (do this one in python please)

I need help with this question please, thank you for the help and taking your time to help me :) 2.1. Consider a state space where the start state is number 1 and each state k has two successors: numbers 2k (left child) and 2k + 1 (right child). (a) Draw the portion of the state space for states 1 to 15. (b) Suppose the goal state is 11. List the steps to follow the following algorithms: (I) BFS (II) DFS (III) UCS (Suppose the cost from parent node to left child node is 1, from parent to right child node is 2) 2.2. Implement the BFS algorithm with the data in assignment 2.1 (start 1, goal 11) in the programming language you are comfortable with. (do this one in python please)