Introduction: In the bubble sort, as elements are sorted they gradually "bubble" (or rise) to their proper location in the array, like bubbles rising in a glass of soda. The bubble sort repeatedly compares adjacent elements of an array. The first and second elements are compared and swapped if out of order. Then the second and third elements are compared and swapped if out of order. This sorting process continues until the last two elements of the array are compared and swapped if out of order. Requirements: 1. Your program should prompt the user to input an array 2. Your program should display the values of the array before sorting 3. Your program should display the values of the array after sorting Hints: using a flag to indicate a swap needed. Initialize flag true . At the start of the loop set flag-false awaiting a possible swap. If a swap occurs, set the flag-true, if no swap in the whole pass, the sorting is completed