Chapter 7 test - Recurrence Relations and Finite-State Mach... Question #1 of 8 There are two parts to this test. The written part and the online part. Print the written part from: https://my.westcottcourses.com/studentInfo/discreteLab Tests/Test7.pdf For the online part, start with question #1 which follows: 1. Find a recurrence relation and initial condition/s that generate the following sequences. 1, 3, 14, 62, 276, ... O A = 3An-1, A1 = 1 O An = 2An-2 + 4An-1 , A1 = 1, A2 = 3 O A = An-2 + 2An-1 , A1 = 1, A2 = 3 O An = 3An-2 - 4An-1 , A 1 = 1, A2 = 3 O None of these Continue Reset answerChapter 7 test - Recurrence Relations and Finite-State Mach... Question #2 of 8 2. Suppose a person invests $3,500 at 7 percent interest compounded annually. LetAn be the amount of money in the account at the end of n years. How long will it take for the person to triple their investment? Round your answer up to the next nearest whole year. Answer: years m ' Reset answer ' Chapter 7 test - Recurrence Relations and Finite-State Mach... Question #3 of 8 3. Determine which of the following recurrence relation is a second order linear, not homogenous and not constant coefficient equation. O An = 2An-1 + 6nAn-2 - 4 O An = 2An-1 + 6nAn-2 O An = 2An-1 + 6An-2 O An = 2An-1 O None of these Continue Reset answerChapter 7 test - Recurrence Relations and Finite-State Mach... Question #4 of 8 4. Find an explicit formula for the following recurrence relation with the given initial condition. An = An-1 - 6, Ao = 2 O An = 6 - 2n O A = 2 - 6(n - 1) O An = 2 - 6n O An = 6 - 2(n - 1) O None of these Continue Reset answerChapter 7 test - Recurrence Relations and Finite-State Mach... Question #5 of 8 5. Find an explicit formula for the following recurrence relations with the given initial conditions. An = 3An_1+ 28An_2, A0 = 3, A1=10 O A. = (4)" + 2(4)" O A. = (4)" + 2(7)" 0 An = 3(4)" - 2n(7)\" O None of these m ' Reset answer Chapter 7 test - Recurrence Relations and Finite-State Mach... Question #6 of 8 6. List all the accepting states of the finite state automaton. a/0 b/0 b/1 a/0 a/0 01 02 b/ 1 O 01, 02 O 00, 01 O 01 O None of these Continue Reset answerChapter 7 test - Recurrence Relations and Finite-State Mach... Question #7 of 8 7. Determine if the following string is accepted by the finite state automaton. abbbaabab a a Co b O Yes O No Continue Reset answerChapter 7 test - Recurrence Relations and Finite-State Mach... Question #8 of 8 8. Determine if the following string is accepted by the finite state automaton. abbbaabab a G0 01 b a a b b a 03 b O Yes O No Continue Reset answer1. Find a recurrence relation and initial condition/s that generate the following sequence: 2, 4, 8, 16, 32, 2. Find a recurrence relation and initial condition/s that generate the following sequence: 1, 2, 5, 11, 26, 59... 3. Suppose a person invests $7,500 at 2.5 percent interest compounded annually. Let An be the amount of money in the account at the end of n years. How long will it take for the person to double their investment? 4. Find an explicit formula for the following recurrence relations for the initial condition given. An = 5An-h A0 = 5 5. Find an explicit formula for the following recurrence relations for the initial condition given. An = 7nAn_1, A0 = 3 6. Find an explicit formula for the following recurrence relations for the initial conditions given. An = 5AM + 24AM A0 = 5, A1 = 18 7. Find an explicit formula for the following recurrence relations for the initial conditions given. An =18An-1' 81An.2, A0 = 5. A1 = 18 8. Given the transition diagram of the finite state machine, draw the transition diagram of the nite state automaton. ea b\\0 a\\0 = \\1