In a large corporation with n salespeople, every 10 salespeople report to a local manager, every 10 local managers report to a district manager, and so forth until finally 10 vice-presidents report to the firm’s president. if the firm has n salespeople, where n is a power of 10, find and solve recurrence relations for (a) the number of different managerial levels in the firm (b) the number of managers (up through president) in the firm

i need more details sorry

step-by-step explanation:

sample answer: you can determine whether each element of the domain is paired with exactly one element of the range. for example, if given a graph, you could use the vertical line test; if a vertical line intersects the graph more than once, then the relation that the graph represents is not a function.

1) letter c.

2) 4 square root of 9

hope this

step-by-step explanation:

the answer is -1 1/5, also a

hope i

-lavira : )