break these questions down and explain why the answers are these

1. (4pts) (A) What is the MAXIMUM mad MINIMM oumber of EDGEs that a connected graph with 16 (sixteen) ventices cau liave? (6pts) (B) A connected, planar graph has ten vertices having degrees 1,2,2,3,3,3,3,4,4, and 5.=30 How many faces arg (MUST SHOW YOUR WORK) 10 NUOE is engor f=ev+2f=1510+2=7 (Gpts) (C) Draw all non-isomorphic connected, cycle-free graphs with 5 vertices: How many such graphs are there? 3 (7 pts) (D) Draw all subgraphs containing exactly two edges of the following graph