#include &lt;iostream&gt;    #include &lt;set&gt;    using namespace std;    int main &#40;&#41;    &#123;        multiset&lt;int&gt; mymultiset;        for &#40;int i = 0; i &lt; 5; i++&#41; mymultiset.insert&#40;i&#41;;        multiset&lt;int&gt; :: key_compare mycomp = mymultiset.key_comp&#40;&#41;;        int highest = *mymultiset.rbegin&#40;&#41;;        multiset&lt;int&gt; :: iterator it = mymultiset.begin&#40;&#41;;        do         &#123;            cout &lt;&lt; ' ' &lt;&lt; *it;        &#125; while &#40;mycomp&#40;*it++, highest&#41;&#41;;        return 0;    &#125;
A. 12345
B. 01234
C. 1234
D. 0123
Answer:A
#include &lt;iostream&gt;    #include &lt;set&gt;    using namespace std;    int main &#40;&#41;    &#123;        multiset&lt;int&gt; mymultiset;        for &#40;int i = 0; i &lt; 5; i++&#41; mymultiset.insert&#40;i&#41;;        multiset&lt;int&gt; :: key_compare mycomp = mymultiset.key_comp&#40;&#41;;        int highest = *mymultiset.rbegin&#40;&#41;;        multiset&lt;int&gt; :: iterator it = mymultiset.begin&#40;&#41;;        do         &#123;            cout &lt;&lt; ' ' &lt;&lt; *it;        &#125; while &#40;mycomp&#40;*it++, highest&#41;&#41;;        return 0;    &#125;
A. 12345 B. 01234 C. 1234 D. 0123