#include &lt;iostream&gt;    #include &lt;deque&gt;    using namespace std;    int main &#40;&#41;    &#123;        unsigned int i;        deque&lt;int&gt; mydeque;        mydeque.push_back &#40;100&#41;;        mydeque.push_back &#40;200&#41;;        mydeque.push_back &#40;300&#41;;        for&#40;deque&lt;int&gt; :: iterator it = mydeque.begin&#40;&#41;; it != mydeque.end&#40;&#41;; ++it&#41;        &#123;        &#125;        mydeque.clear&#40;&#41;;        mydeque.push_back &#40;110&#41;;        mydeque.push_back &#40;220&#41;;        for&#40;deque&lt;int&gt; :: iterator it = mydeque.begin&#40;&#41;; it != mydeque.end&#40;&#41;; ++it&#41;            cout &lt;&lt; ' ' &lt;&lt; *it;        cout &lt;&lt; '\n';        return 0;    &#125;
A. 110
B. 220
C. Both a & b
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;        mydeque.push_back &#40;100&#41;;        mydeque.push_back &#40;200&#41;;        mydeque.push_back &#40;300&#41;;        for&#40;deque&lt;int&gt; :: iterator it = mydeque.begin&#40;&#41;; it != mydeque.end&#40;&#41;; ++it&#41;        &#123;        &#125;        mydeque.clear&#40;&#41;;        mydeque.push_back &#40;110&#41;;        mydeque.push_back &#40;220&#41;;        for&#40;deque&lt;int&gt; :: iterator it = mydeque.begin&#40;&#41;; it != mydeque.end&#40;&#41;; ++it&#41;            cout &lt;&lt; ' ' &lt;&lt; *it;        cout &lt;&lt; '\n';        return 0;    &#125;
A. 110 B. 220 C. Both a & b D. None of the mentioned
Explanation:In this program, We cleared the old values presented in the dequeue with the new values.