#4: "? Backwards Go Patterns Can" SEQUENCE 1: n = 2 n = 3 n = 4 SEQUENCE 2: n = 2 n = 3 n = 4 For EACH sequence above: a) Accurately draw the figures for n = 5, 1, 0, -1, -2, -3 b) Explain your reasoning for the negative n cases. c) Develop a formula for the number of tiles in each figure as a function of n. Be sure your function fits your negative case figures! You may or may not need a piecewise function @ d) Accurately graph your function. Note any lines or points of symmetry