Megan lozano is planning a long-awaited driving tour, which will take her and her family through three different states. megan is interested in seeing 14 monuments, 3 of which are in the first state, 6 of which are in the second state, and 5 of which are in the third state. however, she only has time to see 3 of them. in how many ways could the 3 monuments chosen include sites in fewer than all three states?

Asequence has its first term equal to 4, and each term of the sequence is obtained by adding 2 to the previous term. if f(n) represents the nth term of the sequence, which of the following recursive functions best defines this sequence? (1 point) f(1) = 2 and f(n) = f(n − 1) + 4; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2n; n > 1 f(1) = 2 and f(n) = f(n − 1) + 4n; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2; n > 1 i will award !