Matrix Chain Multiplication Problem

Given 'N' 2-dimensional matrices and an array ARR of length N + 1, where the first N integers denote the number of rows in each matrix and the last integer represents the number of columns of the last matrix. Each matrix's column count matches the row count of the next matrix. Your task is to determine the minimum number of multiplication operations required to multiply all given matrices together.

Input:

'T': number of test cases
For each test case:
1. 'N': the number of matrices
2. List of size 'N + 1' representing the dimensions with first 'N' elements for rows and the last element for columns of the final matrix.

Output:

For each test case, output the minimum number of matrix multiplication operations needed.
Each result should be printed on a new line.

Example:

Input:
T = 1
N = 3
ARR = [2, 4, 3, 2]

Output:
36

Explanation:
With matrices dimensions {2X4, 4X3, 3X2}, the multiplication in order (2X4, 4X3)(3X2) requires 
(2*4*3) + (2*3*2) operations = 36, which is the minimal possible in this case.

Constraints:

• 1 <= T <= 5
• 1 <= N <= 100
• 1 <= ARR[i] <= 10^2

Note: You don't need to execute actual multiplications, just calculate the minimal operations count.