There is a white table with a pile of 2008 coins and there are two empty black tables. At each move, the uppermost coin on a table is transferred to an empty table or to the top of the pile on a non-empty table. What is the least number of moves required to reverse the pile at the beginning on the white table?<spanclass=′latex−bold′>(A)</span>6016<spanclass=′latex−bold′>(B)</span>6017<spanclass=′latex−bold′>(C)</span>6022<spanclass=′latex−bold′>(D)</span>6023<spanclass=′latex−bold′>(E)</span>6024