Explain in words why each recurrence relation is represented by the given description. (You do not need to solve the recurrence.)

B(1) = 2, B(2) = 4, B(3) = 7 B(n) = B(n-1) + B(n-2) + B(n-3) B (n) is the number of n-bit binary strings that avoid 000. for n 3 F(1)F(n) 2F(n/2)+1 for n1 F(n) is the number of matches played in a single elimination tournament with n players (you can assume n 2 for some positive integer k. You can use the bracket below to help explain.) 16 Team Single limination Winner PrintYourBrackets. B(1) = 2, B(2) = 4, B(3) = 7 B(n) = B(n-1) + B(n-2) + B(n-3) B (n) is the number of n-bit binary strings that avoid 000. for n 3 F(1)F(n) 2F(n/2)+1 for n1 F(n) is the number of matches played in a single elimination tournament with n players (you can assume n 2 for some positive integer k. You can use the bracket below to help explain.) 16 Team Single limination Winner PrintYourBrackets