Bubble Sort Problem Statement

Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.

Input:

The first line contains an integer 'T' representing the number of test cases.
Each test case consists of:
The first line containing an integer N denoting the size of the array.
The second line containing N space-separated integers representing the array elements.

Output:

Each test case output will print the sorted array in increasing order in a separate line.

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: You do not need to print anything explicitly. Just implement the given function to sort the array in place.