Algorithm analysis

(where a letter means insert and an asterisk means remove the maximum). Suppose these operation are performed on an initially empty max-oriented heap (max-heap). Draw the sequence of heaps that results from these operations. 1. 2. P R / 1-> / R P 3. R / P I 4. R / P I O 5. 0 P 1-> P 6. R P / / O I 1-> P I R O 7. O P I-> P I O I 8. I O / 1-> / O