3.3 Consider two vectors that are NOT sorted, each containing n comparable items. How long wouldit take to display all items (in any order) which appear in either the first or second vector, but not inboth, if you are only allowed O(1) additional memory? Give the fastest possible algorithmsworst-case time complexity.A.(log n)B.(n)C.(nlog n)D.(n2)E.(n2logn)