Whichalgorithm would you recommend be used to find the fastest route from the distribution center to each of the towns? Demonstrate how it would work on the example above if the distribution center is placed at town G. Show the resulting routes.

= 5

step-by-step explanation:

to find the 15th term substitute n = 15 into the nth term formula

= (- 3 × 15 ) + 50 = - 45 + 50 = 5

a_n = a_1 + (n - 1)d

the first term is 6.

the common difference d = ?

when you find d, replace n with 7 and d with the common difference to find your answer.