Give a recursive algorithm matrix-chain-multiply(a, s, i, j) that actually performs the optimal matrix-chain multiplication for a chain of matrices

Amanda went into the grocery business starting with five stores. after one year, she opened two more stores. after two years, she opened two more stores than the previous year. if amanda expands her grocery business following the same pattern, which of the following graphs represents the number of stores she will own over time?

Which number line correctly shows 0.8 + 0.3?

Simplify using positive exponents only.