Refer to Table 13 -Refer to Table 13

question 35

Multiple Choice

Refer to Table 13.1 for the following questions.
Table 13.1 A very simple economy producing three goods: movies, burgers, and bikes. $$\begin{array} { | c | c | c | c | c | } \hline & { 2012 } &&{ 2017 } \\\hline \text { Product } & \text { Quantity } & \text { Price } & \text { Quantity } & \text { Price } \\\hline \text { Movies } & 20 & \$ 6 & 30 & \$ 7.00 \\\hline \text { Burgers } & 100 & \$ 2 & 90 & \$ 2.50 \\\hline \text { Bikes } & 3 & \$ 1000 & 6 & \$ 1100 \\\hline\end{array}$$ $$\begin{array} { | c | c | c | c | c | } \hline & { 2012 } && { 2017 } \\\hline \text { Praduct } & \text { Quantity } & \text { Price } & \text { Quantity } & \text { Price } \\\hline \text { Movies } & 20 & \$ 6 & 30 & \$ 7.00 \\\hline \text { Burgers } & 100 & \$ 2 & 90 & \$ 2.50 \\\hline \text { Bikes } & 3 & \$ 1000 & 6 & \$ 1100 \\\hline\end{array}$$
-Refer to Table 13.1.What is real GDP in 2017,using 2012 as the base year?

• A) $3 320
• B) $3 690
• C) $6 360
• D) $7 035

---

Definitions:

Binary Search Algorithm

An efficient algorithm for finding a target value within a sorted array by repeatedly dividing in half the portion of the list that could contain the target.

Infinite Recursion

A situation in which a function or method calls itself without an exit condition, leading to a stack overflow error.

Base Case

In recursive programming, a condition that stops the recursion by not making any further calls.

Recursive Methods

Functions or methods in programming that solve problems by calling themselves with modified arguments, often with a base case to end the recursion.