Let g be a connected, weighted graph, let v be a vertex in g, suppose that the weights of the edges incident on v are distinct let e be the edge of minimum weight incident on v must e be contained in every minimum spanning tree?

Martha has a deck of cards. she has lost some of the cards, and now the deck only contains nine spades, eleven diamonds, eight clubs, and twelve hearts. martha predicts that whenever she draws a card from the deck without looking, she will draw a club one-fifth of the time. which activity would best allow martha to test her prediction? a. randomly draw a card from the box and see if it is a club. b. randomly draw a card. then, continue to draw another card until all eight clubs are drawn. c. randomly draw and replace a card 120 times. then, observe how close to 30 times a club is drawn. d. randomly draw and replace a card 100 times. then, observe how close to 20 times a club is drawn.

Triangles abc and dfg are given. find the lengths of all other sides of these triangles if: b ∠a≅∠d, ab·dg=ac·df, ac=7 cm, bc=15 cm, fg=20 cm, and df-ab=3 cm.

Polynomials plz quick 1: subtract and simplify (–y^2 – 4y – 8) – (–4y^2 – 6y + 3)