Modify the application of Exercise 21 to generate and display all the numbers in the seq...

Modify the application of Exercise 21 to generate and display all the numbers in the sequence until a number becomes larger than the value maxNumber entered by the user.

Reference Exercise 21.

A formula to compute the Nth Fibonacci number was given in Exercise 19 in Chapter 3. The formula is useful in finding a number in the sequence, but a more efficient way to output a series of numbers in the sequence is to use the recurrence relation F_N = F_N-1 + F_N-2, with the first two numbers in the sequence F₁ and F₂ both defined as 1. Using this recurrence relation, we can compute the first 10 Fibonacci numbers as follows:

Write an application that accepts N, N 1, from the user and displays the first N numbers in the Fibonacci sequence. Use appropriate formatting to display the output cleanly.