1971 AHSME Problem 17

A circular disk is divided by 2n equally spaced radii(n>0) and one secant line. The maximum number of non-overlapping areas into which the disk can be divided is

\textbf{(A) }2n+1\qquad \textbf{(B) }2n+2\qquad \textbf{(C) }3n-1\qquad \textbf{(D) }3n\qquad \textbf{(E) }3n+1

Full credit goes to MAA for authoring these problems. These problems were taken on the AOPS website.