In a 3-input majority gate, the output \( F \) is '1' when two or more inputs are '1'. Therefore, \( F \) is '1' when at least two of the inputs \( X \), \( Y \), or \( Z \) are '1'. The Boolean expression for this condition is:
\[
F = XY + YZ + ZX.
\]
This expression gives '1' when two or more inputs are '1'. For instance:
\( X = 1, Y = 1, Z = 0 \) gives \( F = 1 \).
\( X = 0, Y = 1, Z = 1 \) gives \( F = 1 \).
\( X = 1, Y = 0, Z = 1 \) gives \( F = 1 \).
Thus, the Boolean expression for the output \( F \) is \( F = XY + YZ + ZX \), which corresponds to option A.