consider the network shown to the right. $($a$)$ how many different spanning trees does this network have? $($b$)$ find the spanning tree that has the largest degree of separation between H & G $($c$)$ find a spanning tree that has the smallest degree of separation between H & G $$ yConsider the network shown in the figure to the right $($a$)$ How many different spanning trees does this network have? $($b$)$ Find the spanning tree that has the largest degree of separation between H and G$.($c$)$ Find a spanning tree that has the smallest degree of separation between H and G$.($a$)$ This network has different spanning trees. $($b$)$ Which spanning tree has the largest degree of separation between Hand G$?$ A$..$ H H o F o OU $1$ D D OJ $-0)$ A O B $$ oc B Ie$)$ Which enanninn tree has the smallest dearen nf senaration between Hand G$?$ween Hand G$.$ veen Hand G$.$ Hand G$?$ OC$..$ H $$ D D OJ O A A oc B wean Hand G$($c$)$ Which spanning tree has the smallest degree of separation between Hand G$?$ OB$.$ D $03$ D $0$ oc O Click to select your answers$)$