Bubble Sort Problem Statement

Sort an unsorted array of non-negative integers using the Bubble Sort algorithm, which swaps adjacent elements if they are not in the correct order to sort the array in non-decreasing order.

Input:

The first line contains an integer 'T', the number of test cases.
For each test case:
- The first line contains an integer N, the size of the array.
- The second line contains 'N' space-separated integers representing the array elements.

Output:

For each test case, output the sorted array in a separate line in increasing order.

Example:

Input:
1
5
6 2 8 4 10
Output:
2 4 6 8 10

Constraints:

• 1 <= T <= 100
• 1 <= N <= 100
• 1 <= Arr[i] <= 1000

Note:

Update the array in place and print the sorted results. No need to handle input/output; just implement the sorting function.