In this question we return to the Brute-Force Bandits, who are going on tour to perform in five cities. The cities and the distances (in miles) between them are given in the weighted graph below. The tour must start and end at A. The cost of the chartered bus in which the band is traveling is $8 per mile. Find the cheapest-link tour, and give the total cost for this tour. Use A as the start/end city. a)The cost of this tour is $
Permutations and Combinations
If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba, cb and ca. It is in a particular order. So, this can be called the permutation of a, b, and c. But if the order does not matter then ab is the same as ba. Similarly, bc is the same as cb and ac is the same as ca. Here the list has ab, bc, and ac alone. This can be called the combination of a, b, and c.
Counting Theory
The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.
In this question we return to the Brute-Force Bandits, who are going on tour to perform in five cities. The cities and the distances (in miles) between them are given in the weighted graph below. The tour must start and end at A. The cost of the chartered bus in which the band is traveling is $8 per mile.
Find the cheapest-link tour, and give the total cost for this tour. Use A as the start/end city.
a)The cost of this tour is $
Trending now
This is a popular solution!
Step by step
Solved in 6 steps
