Please show how you got the answer. Thank you.

A solution to a problem has n possible outcomes. An algorithm to solve the problem uses a k-way decision tree of depth d. Answer each of the following questions. b. Given k and n, what is the smallest value possible for d? A solution to a problem has 75 possible outcomes. An algorithm to solve the problem has a ternary decision tree of depth d. What is the smallest value that d could be