Make a game tree for the game of Nim with starting position $222,$

that is to say, three piles of height $2.$ Which player $($Max or Min$)$

has a strategy to always win, and what should their first move be$?$