Sorting ProgramIn answering each questions, consider the program below:#include <iostream>#include <algorithm>using namespace std;// Function to perform Bubble Sort on an arrayvoid bubbleSort(int arr[], int n) { for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - 1 - i; j++) { // Swap if the element found is greater than the next element if (arr[j] > arr[j + 1]) { swap(arr[j], arr[j + 1]); } } }}int main() { // Given array of 10 numbers int numbers[] = {4, 2, 7, 1, 9, 5, 8, 3, 10, 6}; int n = sizeof(numbers) / sizeof(numbers[0]); // Call the bubbleSort function to sort the array bubbleSort(numbers, n); // Display the sorted array cout << "Sorted array: "; for (int i = 0; i < n; i++) { cout << numbers[i] << " "; } return 0;}---------------------------------------------------------------------------Definition of Terms in the given questions below:In the context of the Bubble Sort algorithm, a "pass" refers to a complete iteration through the array. During each pass, the algorithm compares adjacent elements and swaps them if they are in the wrong order. After each pass, the largest unsorted element is guaranteed to be in its correct position.The number of passes needed to sort an array of size n is generally n - 1. This is because, after the first pass, the largest element is in its correct place, and after the second pass, the second largest element is in its correct place, and so on. After n - 1 passes, the smallest element is also in its correct place, and the array is fully sorted.For example, if you have an array of 5 elements, you would typically need 4 passes to sort it. Each pass contributes to placing one more element in its correct position within the sorted portion of the array.