The equation A⁵ + B⁵ + C⁵ + D⁵ + E⁵ = F⁵ has exactly one integral solution that satisfies 0 < A B C D E F 75. Write a JAVA program to find the solution. Hint: First, precompute all values of X⁵ and store them in an array. Then, for every tuple (A, B, C, D, E), you only need to verify that some F exists in the array. (There are several ways to check for F, one of which is to use a binary search to check for F. Other methods might prove to be more efficient.)