The following problems were inspired by the movie The Hateful Eight... 1. Which of the following best describes the runtime complexity of the following scenario: A person has to put n tent stakes into the ground, starting at a cabin and ending at the outhouse. The tent stakes are to be placed 1 meter apart. Each step in this process involves walking 1 meter and driving a stake into the ground. Assume that the n stakes light enough to carry, and are placed in a backpack and carried along the way. The runtime complexity of this algorithm is best described as: a. logarithmic b. linear c. linearithmic d. quadratic 2. Which of the following best describes the runtime complexity of the following scenario: A person has to put n tent stakes into the ground, starting at a cabin and ending at the outhouse. The tent stakes are to be placed 1 meter apart. Each step in this process involves walking 1 meter and driving a stake into the ground. Assume that the n stakes are heavy, and in this scenario, only one can be carried at a time. The runtime complexity of this algorithm is best described as: a. logarithmic b. linear C. linearithmic d. quadratic