I do not know what to do next (and even if my approach is correct) in the following problem:

[Part 1](https://i.stack.imgur.com/BtEGT.png)
[Part 2](https://i.stack.imgur.com/G0CvX.png)

I have just figured out that a possible MNT (for part a) is to get a jar, test if it breaks from height h, if so then there's the answer, if not, height+1 and keep looping.

For part b is the following. Since we know max height equals n, then we start from n (current height = n). Therefore we go from top to bottom adding to our broken jar count (they are supposed to break if you start from top) until the jars stop breaking. Then the number would be current height + 1 (because we need to go back one index).

For part c, I don't even know what my approach would be, since I am assuming that the order of the algorithm is O(n^c) where c is a fraction. I also know that O(n^c) is faster than O(n).

I also noted that there is a problem similar to this one online, but it talks about rungs instead of a robotic arm. Maybe it is similar? Here is the [link](https://cs.stackexchange.com/questions/11981/balancing-subproblems-in-resilience-testing)

Do you have any recommendations/clues? Any help will be appreciated.

Thank you for your time and help in advance.

Cheers!