Mack plans to meet his 4 friends. how many different ways can he make his visit if he visits each friends once?

  24

Step-by-step explanation:

Mack can choose any of the 4 for the first visit, any of the remaining 3 for the second visit, either of the remaining 2 for the third visit, then visit the last one. There are 4·3·2·1 = 24 ways Mack can do this.

The number 4·3·2·1 is "four factorial", written as 4! (with an exclamation point). It is the number of ways 4 objects can be ordered, called the number of permutations of 4 objects.

(d)

step-by-step explanation:

given: the line in the graph passes through points (5,30) and (6,26).

then, the equation of line is:

now, put y=a(n) and x=n,

hence, option d is correct.