START=1AVAII.N=5 AVAILE =8 Fig. 3 Draw the graph G. Find the changes in the linked representation of graph G if the following operations occur: i) Node F is added to G ii) Edge (B,E) is deleted from G iii) Edge (A,F) is added to G Draw the resultant graph G. START=1AVAII.N=5 AVAILE =8 Fig. 3 Draw the graph G. Find the changes in the linked representation of graph G if the following operations occur: i) Node F is added to G ii) Edge (B,E) is deleted from G iii) Edge (A,F) is added to G Draw the resultant graph G