Suppose your array contained 1,000,000 elements: for a sequential search, how many comparisons would the program need to find the last value in the array? for a binary search, how many comparisons would the program need to find the last value? in this case, which do you think will be faster?

Who invented the tv .hint it was 2 people

If your accelerator suddenly gets stuck what should you do

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.