Jars on a ladder problem. Given a ladder of n rungs and k identical glass jars, one has to designan experiment of dropping jars from certain rungs, in order to find the highest rung (HS) on theladder from which a jar doesn’t break if dropped. Idea: With only one jar (k=1), we can’t risk breaking the jar without getting an answer. So westart from the lowest rung on the ladder, and move up. When the jar breaks, the previous rung isthe answer; if we are unlucky, we have to do all n rungs, thus n trials. Now lets think of k=log(n):with log(n) or more jars, we have enough jars to do binary search, even if jars are broken at everyrung. So in this case we need log(n) trials. Note that we can’t do binary search with less than log(n)jars, as we risk breaking all jars before arriving at an answer in the worst case. Your task is to calculateq = MinT(n, k)= the minimum number of dropping trials any suchexperiment has to make, to solve the problem even in the worst/unluckiest case (i. e., not runningout of jars to drop before arriving at an answer).MinTstands for Minimum number of Trials. A(5 points).Explain the optimal solution structure and write a recursion for MinT(n, k).

What can you find the under the privacy policy section of a shopping website?

Linda subscribes to a cloud service. the service provider hosts the cloud infrastructure and delivers computing resources over the internet.what cloud model is linda using

This program should be a short piece of code that prints all of the positive integers from 1 to 100 as described more fully below. the program may contain multiple methods, and if using an oo language, should be contained within a single class or object. the program should be designed so that it begins execution when invoked through whichever mechanism is most common for the implementation language. â–ş print out all positive integers from 1 to 100, inclusive and in order. â–ş print messages to standard output, matching the sample output below. â–ş in the output, state whether the each integer is 'odd' or 'even' in the output. â–ş if the number is divisible by three, instead of stating that the number is odd or even, state that the number is 'divisible by three'. â–ş if the number is divisible by both two and three, instead of saying that the number is odd, even or divisible by three; state that the number is 'divisible by two and three'. â–ş design the logic of the loop to be as efficient as possible, using the minimal number of operations to perform the required logic. sample output the number '1' is odd. the number '2' is even. the number '3' is divisible by three. the number '6' is divisible by two and three.