Design a divide-and-conquer algorithm that will find the missing string in Θ(n) time. Youcan assume that we can utilize thePartitionalgorithm that is used byQuickSort, bymodifying it to compare strings instead of comparing numbers (you do not need to show howto do the modification). Write the pseudo-code of your algorithm and explain how it works.(Hint: You can select the pivot used forPartitionalgorithm in an informed manner thatguarantees the resultant subarrays to be of nearly equal size.)

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.

In the blank libreoffice writer document, to start the process of entering a date field into a letter, click on the insert menu. edit menu. file menu. fields menu.

20 points archie wants to use a reflector as he photographs a newlywed couple. what would he consider in his choice? a. shadow and sunny b. homemade and professional c. lamps and boards d. incident and reflected e. neutral density and enhancement