To find the Highest Common Factor (HCF) of 132 and 77, we use the Euclidean algorithm.
First, divide 132 by 77:
\[ 132 = 1 \times 77 + 55 \]
Now, divide 77 by 55:
\[ 77 = 1 \times 55 + 22 \]
Next, divide 55 by 22:
\[ 55 = 2 \times 22 + 11 \]
Finally, divide 22 by 11:
\[ 22 = 2 \times 11 + 0 \]
Since the remainder is now 0, the HCF is the last non-zero remainder, which is 11.
Thus, the correct answer is:
\(a)\ 11\)