#include &lt;iostream&gt;    #include &lt;deque&gt;     using namespace std;    int main &#40;&#41;    &#123;        unsigned int i;        deque&lt;int&gt; mydeque;        deque&lt;int&gt; :: iterator it;        mydeque.push_back &#40; 100 &#41;;        mydeque.push_back &#40; 200 &#41;;        mydeque.push_back &#40; 300 &#41;;        for &#40;it = mydeque.begin&#40;&#41;; it != mydeque.end&#40;&#41;; ++it&#41;            mydeque.clear&#40;&#41;;        cout &lt;&lt; ' ' &lt;&lt; *it;    &#125;
A. 100
B. 200
C. 300
D. None of the mentioned
Answer:A
#include &lt;iostream&gt;    #include &lt;deque&gt;     using namespace std;    int main &#40;&#41;    &#123;        unsigned int i;        deque&lt;int&gt; mydeque;        deque&lt;int&gt; :: iterator it;        mydeque.push_back &#40; 100 &#41;;        mydeque.push_back &#40; 200 &#41;;        mydeque.push_back &#40; 300 &#41;;        for &#40;it = mydeque.begin&#40;&#41;; it != mydeque.end&#40;&#41;; ++it&#41;            mydeque.clear&#40;&#41;;        cout &lt;&lt; ' ' &lt;&lt; *it;    &#125;
A. 100 B. 200 C. 300 D. None of the mentioned
Explanation:Errors will arise because we are clearing all the queue values before printing it.