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<spanclass=′latex−bold′>(A)</span>2n+1<spanclass=′latex−bold′>(B)</span>2n+2<spanclass=′latex−bold′>(C)</span>3n−1<spanclass=′latex−bold′>(D)</span>3n<spanclass=′latex−bold′>(E)</span>3n+1