Let g be a connected graph on n vertices. (a) show that any connected subgraph of g on n vertices contains a spanning tree of g. (b) use this to show that if a set s has an edge in common with every spanning tree of g, then it contains a cutset.

Suppose a pendulum is l meters long. the time,t,in seconds that it tales to swing back and forth once is given by t=2.01

Consider the proof. given: segment ab is parallel to line de. prove: what is the missing statement in step 5?

Jack has a piece of red ribbon that is two times as long as his piece of blue ribbon. he says that he can use two different equation to find out how long his piece of red ribbon is compared to his piece of blue ribbon is. is he correct? explain his reasoning