A question similar to deletion distance algorithms problem

You are given operations , an array containing the following twotypes of operations. [o,a,b]-Create and save a rectangle of size a x b[1,a,bl-Answer the question: "Could a box of size a xb fit inside of each of the earlier saved rectangles?". lt ispossible to rotate the rectangles by 9o degrees, ie: a rectangleof dimensions a x b can be rotated so that its dimensions arebxa Your task is to retum an array of booleans, representing the answersto the second type of operation, in the order they appear. Note that the operations should proceed iteratively, so whenoperations[i] is executed, only the results of the previousoperations o,1,. i- 1 are available.