Daniel, Ethan, and Zack are playing a multi-round game of Tetris. Whoever wins 11 rounds first is crowned the champion. However Zack is trying to pull off a “reverse-sweep”, where (at-least) one of the other two players first hits 10 wins while Zack is still at 0, but Zack still ends up being the first to reach 11. How many possible sequences of round wins can lead to Zack pulling off a reverse sweep?