Subtree Removal Game with Fibonacci Tree

Two players alternately remove a chosen node's entire subtree from a recursively defined "Fibonacci tree" (whose sizes follow Fibonacci numbers); the last player to move wins. The task is to decide the winner (and/or count winning moves) by applying combinatorial game theory—compute or characterize Sprague–Grundy values using the tree's Fibonacci recursion to derive an efficient winning-strategy.