Problem 2 Input Hint: you don't need to represent any scenario since you want to find out Program all possible valid states. Think about the value of m. X = X1 :- on(X, Y,0), on(X1, Y,0). X = X1 :- on(X,Y,T), on(X1, Y,T),T=1..m-1. Command ine clingo blocks.Ip blocks_scenario.lp -c m=0 0 clingo blocks.Ip blocks_scenario.lp -c m=1 0 Output M= 0:( with goals and initial state commented). of clingo on(5,1,0) on(3,2,0) on(4,3,0) on(1,4,0) on(2,5,0) on(6,table,0) SATISFIABLE