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).