3 4
5
Which of the following statements must be true and could be used as part of Katherine's proof? Select ALL that apply.
DA m21 = m_5
B
m 2 = m24
m23 = m24+ m25
IC
Do
DE
m 3 + m24+ m25 = 180°
m21 + m2 + m24+ m25 = 180°

vector <int> v[10] ;   //Vector for maintaining adjacency list explained above

   int level[10]; //To determine the level of each node

   bool vis[10]; //Mark the node if visited  

   void bfs(int s) {

       queue <int> q;

       q.push(s);

       level[ s ] = 0 ;  //Setting the level of the source node as 0

       vis[ s ] = true;

       while(!q.empty())

       {

           int p = q.front();

           q.pop();

           for(int i = 0;i < v[ p ].size() ; i++)

           {

               if(vis[ v[ p ][ i ] ] == false)

               {

           //Setting the level of each node with an increment in the level of parent node

                   level[ v[ p ][ i ] ] = level[ p ]+1;                  

                    q.push(v[ p ][ i ]);

                    vis[ v[ p ][ i ] ] = true;

     }

           }

       }

   }