Which set of edges below is the minimum spanning tree of graph H? H 6 d 4 3 b 6 {d, e), {c, d}, {a, b}, {a, d} {d, e), {b, e}, {a, b}, {b, c} {d, e}, {d, c}, {a, b}, {b, d} {d, e}, {b, e}, {a, b}, {c, d} a b 4. OOOO

Discrete Math: Please find the question in the images and provide an answer with an explanation. Thank you

Consider a bipartite graph on the set A = {1,2,3,4,5,6} and B = {7,8,9,10,11,12}, where there is an edge between xe A and y e B if and only if x+y is a multiple of 4. What is the size of N({2})? What is the size of N({2,5})? What is the size of N({2,6})? Is there a matching in this graph? %3D

Q15B. Consider the graph with the following vertices and edges: V = {a, b, c, d, e, f} E = {{a, b}, {a, e}, {b, c}, {b, f}, {d, e}, {e, f}} d a b D e (D Which of the following sets of edges represent subgraphs of the graph that are spanning trees? (Select all that apply.) {{a, b}, {a, e}, {b,c}} {{a, b}, {a, e}, {b,c}, {b, f}, {e, f}} {{a, b}, {b, c}, {d, e}, {e, f}} {{a, b}, {a, e}, {b, c}, {d, e}, {e, f}} C {{a, e}, {b, c}, {b, f}, {d, e}, {e, f}}