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 0(1) additional memory? give the fastest possible algorithm's worst-case time complexity. θ(log n) θ(n) θ(nlogn) θ(n2) θ(n2logn) a. c. d. e.

Write a program that inserts the digits of an integer into an array in originalorderfollowed by reverse order. first, promptthe user to enter a positive integer(> 0). determine the number of digits of the integer. create a dynamically allocated integer arrayof a size twice the number of digits.now insert the digits in original order which will occupy half of the array. then, insert the digits in reverse order.finally, output thedigits in thearray.use at least two functions to organize your program.