#include &lt;iostream&gt;    #include &lt;queue&gt;    using namespace std;    int main &#40;&#41;    &#123;        priority_queue&lt;int&gt; mypq;        mypq.push&#40;30&#41;;        mypq.push&#40;100&#41;;        mypq.push&#40;25&#41;;        mypq.push&#40;40&#41;;        while &#40;!mypq.empty&#40;&#41;&#41;        &#123;            cout &lt;&lt; &quot; &quot; &lt;&lt; mypq.top&#40;&#41;;            mypq.pop&#40;&#41;;        &#125;        cout &lt;&lt; endl;        return 0;    &#125;
A. 100 40 30 25
B. 100 40 30
C. 100 40
D. None of the mentioned
Answer:A
#include &lt;iostream&gt;    #include &lt;queue&gt;    using namespace std;    int main &#40;&#41;    &#123;        priority_queue&lt;int&gt; mypq;        mypq.push&#40;30&#41;;        mypq.push&#40;100&#41;;        mypq.push&#40;25&#41;;        mypq.push&#40;40&#41;;        while &#40;!mypq.empty&#40;&#41;&#41;        &#123;            cout &lt;&lt; &quot; &quot; &lt;&lt; mypq.top&#40;&#41;;            mypq.pop&#40;&#41;;        &#125;        cout &lt;&lt; endl;        return 0;    &#125;
A. 100 40 30 25 B. 100 40 30 C. 100 40 D. None of the mentioned
Explanation:In this program, We used priority_queue and with that we are pushing and popping out the elements.