The vertex and edge set of a graph is given below. draw a representation of the graph.

v = {f, g, h, i, j, k, l, m, n, o, p, q, r}

e = { {f, g}, {f, h}, {f, i}, {f, k}, {g, h}, {h, m}, {h, p}, {i, q}, {i, r}, {j, r}, {k, m}, {k, o}, {k, r}, {l, q}, {m, q} }

which vertex has the highest degree?

is this graph connected?

Miranda is braiding her hair.then she will attach beads to the braid.she wants 1_3 of the beads to be red.if the greatest number of beads that will fit on the braid is 12,what other fractions could represent the part of the beads that are red?

I'm confused on how to solve the triangle. can someone me ?

The investigating team suspected that there were differences in the cost of repairing cars in workshop i and workshop ii. the investigating team suspected that the costs raised by workshop i were greater than workshop ii. for that they tested the repair of 15 cars in each workshop to see the cost of repairs.the decision of the right hypothesis to prove the suspicion above is a. h0 : μ1- μ2­ = 0; ha : μ1- μ2­ ≠ 0 b. h0 : μ1- μ2 ≥ 0; ha : μ1- μ2 < 0 c. h0 : μd ≥ 0; ha : μd < 0 with μd = μ2- μ1 d. h0 : μd = 0; ha : μd ≠ 0 with μd = μ2- μ1 e. h0 : μ1- μ2 = 0; ha : μ1- μ2 ≥ 0