Recurrence relations
(1) find a recurrence relation for the number length n bit strings that start and end in 1 (where n > = 2)
(2) use this recurrence relation to find the number of permutations of a set with n elements using the expansion method.

i am unable to solve this problem

step-by-step explanation:

a 4/6 = 9/12   not proportional

step-by-step explanation:

to find which are not proportional, we can use cross products

if it is true, they are proportional.   if it is not true, they are not proportional.

a 4/6 = 9/12

4* 12 = 6*9

48 = 54

not this is not proportional  

b 2/3 = 12/18  

2* 18 = 3 * 12

36 = 36

this is proportional

c 5/4 = 10/8  

5*8 = 4*10

40 = 40

this is proportional

d 7/5 = 35/25

7*25 = 5 * 35

175 = 175

is proportional