Consider the following java-like code for a recursive sorting algorithm: // sorts the items from l[i] through l[j] void threewaysort(int[ ] l, int i, int j) { if (l[i] > l[j]) swap (i, j); if ((j - i + 1) > 2) { t = (j - i + 1)/3; threewaysort(l, i, j-t); threewaysort(l, i+t, j); threewaysort(l, i, j-t); } } (a) prove that this algorithm is correct, that is, that the call threewaysort(l, 0, l. length-1) actually has the side effect of making l sorted. (b) let f(n) be the running time of threewaysort(l, i,j) when j − i + 1 = n. write a recurrence for f(n). (c) solve your recurrence to determine the worst-case running time of threewaysort on lists of size n. how does it compare to other sorting algorithms you know?

The "instance" relationship shows that something is an object of a

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; }

Your mom wants to purchase a laptop computer. she said she wants her new computer to be able to play her dvds so she can listen to music and wants to know what type of optical drives will play her disk. which type of drive should she look for?