Answer:
Step-by-step explanation:
1] the minimum number of arcs in any strongly connected digraph with n vertices is 'n' . the graph look like a cycle
the graph is in the attached file
in a directed cycle we have strongly connected graph since we can reach any vertax from any vertax, it has minimum arc which is 'n'
since if we use less than n vertax then the given graph has atmost one tree which is not strongly connected graph.
2] the maximum distance between two vertax is 5 which from veratx 1 to vertax 6 distance is 5
1----->2------->3--------->4------->5-------->6
if we use cycle of n node then the maximum distance between two vertax is n-1
N= number of tickets purchased= 5 people went to the movies
t= cost of each ticket
$55.50 - $29.25= n * t
$55.50 - $29.25= 5t
OR
$55.50= 5t + $29.25
ANSWER: $55.50 - $29.25= 5t OR
$55.50= 5t + $29.25 (there were no equations to choose from, but it should look something like one of these).
Hope this helps! :)
I will try my best are there answers