Create a spanning tree using the breadth-first search algorithm. Start at A (ie 0). What is the maximum number of
edges needed to connect any other vertex to vertex 'A'?

Write the fraction 9/50 as a decimal if needed round to the nearest hundredth

Amachine that produces a special type of transistor (a component of computers) has a 2% defective rate. the production is considered a random process where each transistor is independent of the others. (a) what is the probability that the 10th transistor produced is the first with a defect? (b) what is the probability that the machine produces no defective transistors in a batch of 100? (c) on average, how many transistors would you expect to be produced before the first with a defect? what is the standard deviation? (d) another machine that also produces transistors has a 5% defective rate where each transistor is produced independent of the others. on average how many transistors would you expect to be produced with this machine before the first with a defect? what is the standard deviation? (e) based on your answers to parts (c) and (d), how does increasing the probability of an event a↵ect the mean and standard deviation of the wait time until success?

Hurry!me out! m c 8 10 12 gracie's art box has 5 less crayons, c, than three times the number of markers, m. function: c = 3m - 5 complete the table to show how the number of crayons depends on the number of markers. enter answers in order from top to bottom.