Please answer this question in Java, and use comments to explain. Thank you!

2. (10 points) Implement the algorithm that solves the Fake-Coin problem using Ternary Search (either iteratively or recursively). In other words, given an integer array of coin weights with n entries, implement a method that finds the index of the fake coin in the array by keep dividing the coins into 3 parts. Note that, n might not always be divisible by 3 , so what are the cases we need to consider? For the weights array, say (n1) entries contain the int 2 (weight of the real coins) and exactly 1 entry contains the int 1 (weight of the fake coin)