Herm and his 12 followers have created a not-so-secret ``handshake'' that involves three people. the first person (the hook) initiates the greeting by casting an invisible fishing line, and the second person (the bait) walks toward the first person as if the ``bait'' is being reeled via the invisible fishing line. when the bait is about to meet the hook, they both go up with hand as if to perform a ``high five.'' at that point, however, a third person (the bandit) steps in to ``steal'' the ``high five'' from the hook. within herm's group, how many different handshakes are possible?

The number of people in this problem is 13, herm and his 12 followers. The secret handshake involve three different roles, so the order of member is important. Every member only able to do 1 roles for every handshake. The number of possible ways for the handshake would be:

13!/(13-3)!= 13*12*11= 1716 ways

f(x) is the value of the function. b is the value of the function when x equals zero or the y-coordinate of the point where the line crosses the y-axis in the coordinate plane.

step-by-step explanation:

hope this !

  y= -3x is the required function.

step-by-step explanation:

we have been given a table:

x             y

0             0

1             -3

3             -9

-2             6

we can see that the values of y is -3 times the value of x

hence, the function would be: y= -3x.

put the values of x will give the same y as in the table that means function is satisfying the given table.