The input to the following algorithm is a positive integer. the goal is to find the digit in the hundreds place of the integer. (for example, if we input 28398, we want the algorithm to output 3.) below is the proposed algorithm, but the values of x and y are missing: step 1: divide the input by x. call the quotient and ignore the remainder. step 2: now divide by y. ignore the quotient and call the remainder step 3: return what x, y will allow this algorithm to correctly find the hundreds digit of the input? put x in the first blank and y in the second blank. note: we would say that has a quotient of 2 and a remainder of 1.

Fill in the following program so that it will correctly calculate the price of the orange juice the user is buying based on the buy one get one sale.#include //main functionint main() { int cartons; float price, total; //prompt user for input information printf("what is the cost of one container of oj in dollars? \n"); scanf(" [ select ] ["%d", "%c", "%f", "%lf"] ", & price); printf("how many containers are you buying? \n"); scanf(" [ select ] ["%d", "%c", "%f", "%lf"] ", & cartons); if ( [ select ] ["cartons / 2", "cartons % 1", "cartons % 2", "cartons % price", "cartons / price", "cartons / total"] [ select ] ["=", "==", "! =", "< =", "> =", "< "] 0) total = [ select ] ["price * cartons", "cartons * price / 2 + price", "(cartons / 2) * price", "cartons / (2.0 * price)", "(cartons / 2.0) * price + price", "((cartons / 2) * price) + price"] ; else total = ((cartons / 2) * price) + price; printf("the total cost is $%.2f.\n", total); return 0; }