you give tree undirecte connect acyclic graph consist n vertex you play game treeinitially vertice white on turn game choose vertex paint black then turn choose white vertex adjacent connect edge black vertex paint blackeach time choose vertex turn gain number point equal size connect component consist white vertex contain choose vertex the game end vertex paint blacklet follow examplevertice 1 4 paint black if choose vertex 2 gain 4 point connect component consist vertex 2 3 5 6 if choose vertex 9 gain 3 point connect component consist vertex 7 8 9your task maximize number point gain