Problem 9/9 (27 points) You are doing some stress-testing on various models of glass jars to determine the height from which they can be dropped and still not break. The setup for this experiment, on a particular type of jar, is as follows. You have a ladder with n rungs, and you want to find the highest rung from which you can drop a copy of the jar and not have it break. We call, this the highest safe rung. (1) You can only use one jar. . Design an algorithm to find the highest safe rung, write the pseudocode. . What is the time complexity of your algorithm? (2) You can use as many jars as you want. . Design an algorithm to find the highest safe rung, write the pseudocode. . What is the time complexity of your algorithm? (3) Supposen is an integer, and you can only use at most two jars. . Design an efficient algorithm to to find out the highest safe rung (complexity of your solution should be less than O(n)), write the pseudocode. . What is the time complexity of your algorithm? February 5, 2020 Assignment 1 of CSC 401/501 (S20, Dr. Zuo) Assignment 1 of CSC 4017501 (520, Dr. Zuo) Page 4 of 4 Page 4 of 4 . How many drops do you need to do at most to identify the highest safe rung? Problem 9/9 (27 points) You are doing some stress-testing on various models of glass jars to determine the height from which they can be dropped and still not break. The setup for this experiment, on a particular type of jar, is as follows. You have a ladder with n rungs, and you want to find the highest rung from which you can drop a copy of the jar and not have it break. We call, this the highest safe rung. (1) You can only use one jar. . Design an algorithm to find the highest safe rung, write the pseudocode. . What is the time complexity of your algorithm? (2) You can use as many jars as you want. . Design an algorithm to find the highest safe rung, write the pseudocode. . What is the time complexity of your algorithm? (3) Supposen is an integer, and you can only use at most two jars. . Design an efficient algorithm to to find out the highest safe rung (complexity of your solution should be less than O(n)), write the pseudocode. . What is the time complexity of your algorithm? February 5, 2020 Assignment 1 of CSC 401/501 (S20, Dr. Zuo) Assignment 1 of CSC 4017501 (520, Dr. Zuo) Page 4 of 4 Page 4 of 4 . How many drops do you need to do at most to identify the highest safe rung