Mr. Winking needs his computer hooked up to every station in the school. Not every station is connected to every other station. The cost of connecting various stations is represented in the graph below. What is the cost of the minimum spanning tree using Kurskal’s Algorithm?

Question 6 options:

58

60

64

62

Derek purchased a new gym membership. it costs him seven dollars a month plus two dollars for every time that he visits the gym. he wants to spend less than 25 dollars a month to visit the gym. write an inequality that models the situation using the variable v for the number of visits per month. also find the maximum number of visits he can make to the gym and still keep his cost below 25 dollars a month.