Pell’s equation. Compose a BigInteger client Pell that reads in an integer c and finds the smallest solution to Pell’s equation: x 2 − c y 2 = 1. Try c = 61. The smallest solution is (1,766,319,049,...

Pell’s equation. Compose a BigInteger client Pell that reads in an integer c and finds the smallest solution to Pell’s equation: x²
− c y²
= 1. Try c = 61. The smallest solution is (1,766,319,049, 226,153,980). For c = 313, the smallest solution is (3,218,812,082,913,484, 91,819,380,158,564,160). The problem is provably unsolvable in a polynomial number of steps (as a function of the number of bits in the input c) because the output may require exponentially many bits!