The Block Coloring Problem (BCP). Given a set of k colors, the objective of the BCP is to color each block such that each no overlapping blocks have the same color. This question has two parts. First, formulate the 4-color BCP below as an uninformed search problem. (Identify initial state, states, successor function, goal test, and path cost). Secondly, if we formulate the 4-color BCP as a constraint satisfaction problem how many constraints will be present (identify them)? The Block Coloring Problem (BCP). Given a set of k colors, the objective of the BCP is to color each block such that each no overlapping blocks have the same color. This question has two parts. First, formulate the 4-color BCP below as an uninformed search problem. (Identify initial state, states, successor function, goal test, and path cost). Secondly, if we formulate the 4-color BCP as a constraint satisfaction problem how many constraints will be present (identify them)