We want to tile an n × 1 strip with tiles of two types: 1 × 1 tiles that are dark-blue light-blue. and red, and 2 × 1 green tiles. Give a formula for the number of such tilings Tn, considering that blue tiles cannot be next to each other. Your solution must include a recurrence equation (with initial conditions!), a . You do not need to solve it

rick would give her the best deal as he will charge $8.88 per hour

step-by-step explanation:

4  

25

5258y

54.

t5

5r

54

5856

542

5458

86

.8558.65

565

565

55898

786

8/95

5896

8656265

556478

step-by-step explanation:

given expression is .

now we need to simplify the given expression .

we know that square root is equivalent to the power 1/2. so that means we can take half of the exponents to get the square root of given expression.

expanding that will give a very very large number so let's keep answer in exponent form.