There are three pairs of socks of three different types a, b, and c in a drawer. the goal is to pair these socks. if socks are pulled out two at a time and put back if not matching, what is the maximum number of times repeating this process until the socks are paired?

120

Step-by-step explanation:Total number of 3 pairs of socks=6

Socks pull in 2s n put back if not matching

P(n)=n!= 6!/3! =6×5×4×3×2/(3×2)

=120

$4

step-by-step explanation:

$30×5=$150

$150 minus $130=$20

$20÷5=$4.

hope to and hope that my answer is brainliest.(follow me )

the equivalent expression are always the hardest ones but you look at the gcf also

step-by-step explanation: