To confirm the function's bijectivity, we must verify it is both injective (one-to-one) and surjective (onto). 1. Injectivity (One-to-one): A function is injective if distinct inputs yield distinct outputs. Assuming $f(x_1) = f(x_2)$, which means \[ \frac{x_1 - 2}{x_1 - 3} = \frac{x_2 - 2}{x_2 - 3} \] Cross-multiplication yields: \[ (x_1 - 2)(x_2 - 3) = (x_2 - 2)(x_1 - 3) \] Expanding and simplifying: \[ x_1 x_2 - 3x_1 - 2x_2 + 6 = x_2 x_1 - 3x_2 - 2x_1 + 6 \] After algebraic manipulation, we arrive at: \[ x_1 = x_2 \] This demonstrates the function is injective. 2. Surjectivity (Onto): A function is surjective if every element in its codomain is an output for at least one input. For every $y \in B = \mathbb{R} - \{1\}$, we need to find an $x \in A = \mathbb{R} - \{3\}$ such that $f(x) = y$. Let \[ y = \frac{x - 2}{x - 3} \] Multiply both sides by $(x - 3)$: \[ y(x - 3) = x - 2 \] Expand and rearrange: \[ yx - 3y = x - 2 \] \[ x(y - 1) = 3y - 2 \] \[ x = \frac{3y - 2}{y - 1} \] This equation shows that for any $y$ in the codomain $\mathbb{R} - \{1\}$, a corresponding $x$ exists in the domain $\mathbb{R} - \{3\}$ such that $f(x) = y$. Therefore, the function is surjective. As the function is both injective and surjective, it is bijective.