Travelling Salesman Problem

Given a list of cities numbered from 0 to N-1 and a matrix DISTANCE consisting of 'N' rows and 'N' columns, representing the distances between each pair of cities, find the shortest possible route that visits each city exactly once and returns to the starting city.

Input:

The first line contains a single integer 'T' denoting the number of test cases. Each test case is as follows:

The first line contains an integer 'N', representing the number of cities.
The next 'N' lines contain 'N' space-separated integers 'DISTANCE[i][j]', where DISTANCE[i][j] denotes the distance from the ith city to the jth city.

Output:

For each test case, return the minimum distance of the shortest possible route that visits each city exactly once and returns to the starting city.

Example:

Input:
2
3
0 10 15
10 0 20
15 20 0
4
0 29 20 21
29 0 15 17
20 15 0 28
21 17 28 0

Output:
35
60

Constraints:

• 1 <= T <= 5
• 2 <= N <= 16
• 0 <= DISTANCE[i][j] <= 10⁹
• Time Limit: 1 sec

Note:

You don’t need to print anything; It has already been taken care of. Just implement the given function.