#include &lt;iostream&gt;    #include &lt;algorithm&gt;    #include &lt;vector&gt;    using namespace std;    int main &#40;&#41;     &#123;        int first&#91;&#93; = &#123;5, 10, 15&#125;;        int second&#91;&#93; = &#123;50, 40, 30&#125;;        vector&lt;int&gt; v&#40;4&#41;;        vector&lt;int&gt; :: iterator it;        sort &#40;first, first + 3&#41;;        sort &#40;second, second + 3&#41;;        it = set_symmetric_difference &#40;first, first + 2, second, second + 2,         v.begin&#40;&#41;&#41;;        v.resize&#40;it - v.begin&#40;&#41;&#41;;        for &#40;it = v.begin&#40;&#41;; it != v.end&#40;&#41;; ++it&#41;        cout &lt;&lt; ' ' &lt;&lt; *it;        return 0;    &#125;
A. 5 10
B. 30 40
C. 50 40
D. Both a & b
Answer:A
#include &lt;iostream&gt;    #include &lt;algorithm&gt;    #include &lt;vector&gt;    using namespace std;    int main &#40;&#41;     &#123;        int first&#91;&#93; = &#123;5, 10, 15&#125;;        int second&#91;&#93; = &#123;50, 40, 30&#125;;        vector&lt;int&gt; v&#40;4&#41;;        vector&lt;int&gt; :: iterator it;        sort &#40;first, first + 3&#41;;        sort &#40;second, second + 3&#41;;        it = set_symmetric_difference &#40;first, first + 2, second, second + 2,         v.begin&#40;&#41;&#41;;        v.resize&#40;it - v.begin&#40;&#41;&#41;;        for &#40;it = v.begin&#40;&#41;; it != v.end&#40;&#41;; ++it&#41;        cout &lt;&lt; ' ' &lt;&lt; *it;        return 0;    &#125;
A. 5 10 B. 30 40 C. 50 40 D. Both a & b
Explanation:In this style algorithm, We are finding the symmetric difference between the vectors and printing it.