Final answer:
To find an optimum parenthesization of a matrix-chain multiplication with given dimensions, we need to minimize the number of scalar multiplications required.
Step-by-step explanation:
To find an optimum parenthesization of a matrix-chain multiplication, we need to consider the order in which the matrices are multiplied. Given the sequence of dimensions <5, 10>, we can represent it as (A1 x A2) x A3, where A1 has dimensions 5 x 10, A2 has dimensions 10 x ?, and A3 has dimensions ? x ?.
The optimal parenthesization depends on the value of ? which is not provided in the question. To find the optimal parenthesization, we need to minimize the number of scalar multiplications required.