*I got the same table as Arjun sir got.*

& Everybody must know that how it derived.

But I* think for **average** mind like me it will **time-consuming** in **exam.*

I have one observation while I* read this question.*

Imp Note : I have Considered (find,insert,delete,dec-key) operations while giving ans.** **

**Before and After doing operations on data structure x it is required that it should be data structure x only.Now replace x with given data structures.**

So If it is a heap then after doing specified operations(find,insert,delete,dec-key) it should be heap only.

Means Heap Constraint need to be satisfied. Same phenomena applicable for other data structure.

**So max time is consuming in fulfilling that constraint.**

That's why Unsorted Array (where no such constraint) won the Race compare to Heap,Sorted array and Sorted doubly linked list which are truely structured.

*So Option A. unsorted array is Ans.*

PS:- 1. Plz verify my ans. And comment if u r not agree.

2. Must realize Arjun sir's Ans.