Find a Matrix a and a Column Matrix B That $$\mathrm { AB } = \left[ \begin{array} { r } 1272 \\1118 \\956\end{array} \right]$$

question 343

Multiple Choice

Find a matrix A and a column matrix B that describe the following tables involving credits and tuition costs. Find the
matrix product AB, and interpret the significance of the entries of this product.
-

• A) \[\mathrm { AB } = \left[ \begin{array} { r } 1272 \\ 1118 \\ 956 \end{array} \right]\] Tuition for Student 1 is \(\$ 1272\), tuition for Student 2 is \(\$ 1118\), and tuition for Student 3 is \(\$ 956\).
• B) \[\mathrm { AB } = \left[ \begin{array} { r } 892 \\ 1026 \end{array} \right]\] College A costs \(\$ 892\) and College B costs \(\$ 1026\).
• C) \[\mathrm { AB } = \left[ \begin{array} { r } 1262 \\ 1088 \\ 951 \end{array} \right]\] Tuition for Student 1 is \(\$ 1262\), tuition for Student 2 is \(\$ 1088\), and tuition for Student 3 is \(\$ 951\).
• D) \[\mathrm { AB } = \left[ \begin{array} { r } 937 \\ 1140 \end{array} \right]\] College A costs \(\$ 937\) and College B costs \(\$ 1140\).

---

Definitions:

Recursive Method

A method in programming that calls itself in order to solve a problem.

Infinite Recursive Method

A method in programming that calls itself indefinitely due to a missing or incorrect termination condition, leading potentially to a stack overflow error.

Infinite Recursion

A condition in programming where a function continuously calls itself without any terminating condition, leading to a potential stack overflow error.

Recursive Method

A method in programming that calls itself in order to solve a problem by breaking it down into smaller, more manageable problems.