There are n marble balls, one of which is made of a differentmaterial. You have access to a Comparator that can compare twoinputs (of an arbitrary number of marble balls) and determine ifthe two inputs are the same or not. The problem is to find thesingle marble ball that is different from the others whileminimizing the number of times you access the Comparator. Design anefficient algorithm based on prune-and-search to solve the problem.Derive the time complexity of your algorithm
