consider two vectors that are not sorted, each containing n comparable items. how long would it take to display all items (in any order) which appear in either the first or second vector, but not in both, if you are only allowed θ(1) additional memory? give the worst-case time complexity of the most efficient algorithm.