k black pieces are placed on k consecutive squares of top row starting from upper left of a 2×5 board. We are placing white pieces on empty squares one by one in arbitrary order. Two squares is said to adjacent if they have common vertex. When a white piece is placed on a square, the pieces on adjacent squares change their color. For which k, when all the squares are filled, it is possible that color of every piece is white?<spanclass=′latex−bold′>(A)</span>0<spanclass=′latex−bold′>(B)</span>1<spanclass=′latex−bold′>(C)</span>2<spanclass=′latex−bold′>(D)</span>3<spanclass=′latex−bold′>(E)</span>None