LongestNecklace: Description In an old drawer of your desk, you...

Help finish the Question using Java code + explanation + efficient, thanks.

Description In an old drawer of your desk, you have found some long-forgotten nec klaces. Each necklace comprises a number of beautiful, once shiny, be ads. Unfortunately, now they are not only dusty, but also tangled togeth er. You remember that the necklace with the most beads used to be yo ur favorite. Now, you are interested in finding the necklace with the larg est number of beads, without having to untangle them all. You have carefully photographed the necklaces and numbered all the b eads with numbers in the range (O.N-1), so that each number corresp onds to exactly one bead. Then, for each bead, you have found the nu mber of the next bead following it This information is given as an array of integers, indexed by bead num bers, and the elements are the numbers of the following beads. Each b ead number appears in the array exactly once. Write a function: de solution(A) that, given an array A consisting of Nintegers, as described above, ret urns the maximum number of beads in a single necklace. The function should return O if the array is empty. For example, given array A such that: A[0] = 5A[1] = 4A[2] = DA[3] = 3A[4] = 1A[5] = 6A[6] = 2 the function should return 4, because the longest necklace is the one c ontaining four beads: numbers (0,5,6, 2). Presented below are the unt angled necklaces. Input Given an array A consisting of Nintegers Nis an integer within the range [0.1,000,000); . the elements of A are all distinct each element of array A is an Integer within the range [O.N-1]. Output Returns the maximum number of beads in a single necklace Sample Input 1 Sample Output 1 5.4.0.3.1.6.2 4