15 15. A graphic artist uses a program to draw geometric shapes in a given pattern. The program zoom in algorithm that draws the shapes based on input from the artist. The table shows the approximate number of steps the algorithm takes to draw different numbers of shapes. Number of Number of Shapes Drawn Steps 4 17 5 24 6 35 7 50 Based on the values in the table, which of the following best characterizes the algorithm for drawing n shapes, where n is a very large number? a. The algorithm runs in a reasonable amount of time because it will use approximately n steps to draw n shapes. b. The algorithm runs in a reasonable amount of time because it will use approximately n- steps to draw n shapes. c. The algorithm runs in a unreasonable amount of time because it will use approximately n steps to draw n shapes. d. The algorithm runs in a unreasonable amount of time because it will use approximately n- steps to draw n shapes. zoom Multiple Choice (2 points each). No partial credit will be given. Some questions require 2 answers. 1 Which of the following is true of algorithms? a. Algorithms may have an infinite set of instructions b. Algorithms must be expressed using a programming language c. Every algorithm can be constructed using combinations of sequencing, selection, and iteration d. Every problem can be solved with an algorithm zoom in 9 The graph shows the efficiencies of two different algorithms that solve a problem. Which o following is most efficient? Algorithm B Iterations Algorithm A Input Size a. These algorithms are equally efficient b. Algorithm A is more efficient than algorithm B c. Algorithm B is more efficient than algorithm A d. The algorithms have different efficiencies depending on the input size