Concept:
A full adder is a combinational circuit that performs addition of three bits: \(A, B,\) and carry-in \(C_{in}\).
Step 1: Output expressions
Sum:
\[
S = A \oplus B \oplus C_{in}
\]
Carry:
\[
C = AB + BC_{in} + AC_{in}
\]
Step 2: Multiplexer capability
A multiplexer can implement any Boolean function by selecting appropriate inputs.
Step 3: Using MUX
By treating input variables as select lines, the output function can be mapped.
Step 4: Practical implementation
Full adder is commonly realized using 8:1 or 4:1 multiplexers.
Step 5: Conclusion
\[
\boxed{\text{Multiplexers}}
\]
Final Answer:
\[
\boxed{(B)}
\]