The maximum number of socks in the sorting space can then be any number from 1 to n. For example with 3 pairs, pulling them in the order AABBCC will only require one space, ABACCB requires two, and ABCABC will require three spaces.

Find the expected number of sorting spaces required in terms of n.