Reference no: EM133269918

Write a method that does a breadth-first search from a given cube, returning the first sequence of moves found that reaches the solution state. Add a "bfs" command-line command that receives a sequence of moves; applies the sequence of moves to the default state to create an initial state; and then runs the breadth-first search on it. The output should print the following: • the entire sequence of moves and relative states to solve the changed cube with 3 cubes per line, • the number of nodes that were explored, • and the time that the function took to find the solution.