1. A stick n inches long must be cut into n 1-inch pieces. We could cut the stick (n-1) times, but we would like to minimize the number of times the saw is used. Several stick pieces can be stacked together and cut at the same time. Draw the sticks and illustrate their arrangement so the saw is used as few times as possible. Clearly identify the stick lengths at each cut, and clearly identify the number of cuts needed. a. Solve the problem for a 30-inch stick. (2 points) b. Solve the problem for a 33-inch stick. (2 points) State a general formula for the minimum number of cuts for an n-inch stick. (2 points) c. 1. A stick n inches long must be cut into n 1-inch pieces. We could cut the stick (n-1) times, but we would like to minimize the number of times the saw is used. Several stick pieces can be stacked together and cut at the same time. Draw the sticks and illustrate their arrangement so the saw is used as few times as possible. Clearly identify the stick lengths at each cut, and clearly identify the number of cuts needed. a. Solve the problem for a 30-inch stick. (2 points) b. Solve the problem for a 33-inch stick. (2 points) State a general formula for the minimum number of cuts for an n-inch stick. (2 points) c