Suppose we are given a weighted connected undirected graphGwhere every vertex is colored either red orblack, and we want to find a spanning tree where no edge is between two vertices of the same color (we callsuch an edgemonochromatic). Describe an algorithm which either finds such a tree of least total weight ordetermines that none exists (e. g. if all vertices have the same color). Give a short argument for why youralgorithm is correct.

What do character formats do for your document's message? a.set the tone b.provide organization c.provide clarity d.set how texts align with documents

Many everyday occurrences can be represented as a binary bit. for example, a door is open or closed, the stove is on or off, and the fog is asleep or awake. could relationships be represented as a binary value? give example.

1. which of the following statements are true about routers and routing on the internet. choose two answers. a. protocols ensure that a single path between two computers is established before sending packets over it. b. routers are hierarchical and the "root" router is responsible for communicating to sub-routers the best paths for them to route internet traffic. c. a packet traveling between two computers on the internet may be rerouted many times along the way or even lost or "dropped". d. routers act independently and route packets as they see fit.