A solution to a problem has n possible outcomes. An Algorithm to solve the problem uses a k-way decision tree of depth d. Given k and n, what is the smallest value possible for d?
The response must be typed, single spaced, must be in times new roman font (size 12) and must follow the APA format.