A sales representative must visit nine cities. There are direct air connections between each of the cities. Use the multiplication rule of counting to determine the number of different choices the sales representative has for the order in which to visit the cities.

362880

Step-by-step explanation:

Given that a sales representative must visit nine cities. There are direct air connections between each of the cities

Since there are direct connections between any two pairs the sales rep can visit in any order as he wishes.

He has 9 ways to select first city, now remaining cities are 8.  He can visit any one in 8 ways.

i.e. No of ways of visiting 9 cities in any order = 9P9

= 9!

= 362880

So no of ways he visits the cities since there are direct connections between any two cities is

362880

v: l•w•h÷2.

v: 20•6•8 ÷2

v: 960÷2

v: 480

answer: 10 turtles

step-by-step explanation: as turtles have four legs so 4.10=40 therefore birds are 4 which sue counted