Given a chain (8, 10, 5, 7, 12, 15, 3, 7, 6) of 8 matrices, where matrix Ai (i = 1, 2, n) has the dimension p_i-1p_i, Find the optimal sequence of pairings for multiplication of matrices (A1; A2; An). Once the sequence of pairings for matrix multiplication is done, the matrix chain product can be calculated with the best computation cost (number of scalar multiplications).