There are 4 teams in total and each team has 7 members. One of the team will be the host team.
Tournament committee will be made from 3 members from the host team and 2 members from each of the three remaining teams. Selecting the members for tournament committee is a combinations problem. We have to select 3 members out 7 for host team and 2 members out of 7 from each of the remaining 3 teams.
So total number of possible 9 member tournament committees will be equal to:

This is the case when a host team is fixed. Since any team can be the host team, there are 4 possible ways to select a host team. So the total number of possible 9 member tournament committee will be:

Therefore, there are 2917215 possible 9 member tournament committees
Sir you posted question and answer? or are providing examples of preferred format?
Answer:
Step-by-step explanation:
x/70=0.5/20
x=35/20
x=1.75
Ann will need 1.75 cups of sugar.
Answer:
1.False
2.False
3.True
4.True
5.not sure, it could be true or false because adjacent angles can add up to 180 or even 360 as long as they have the same vertex
Answer:

Step-by-step explanation:
Let the numbers be 
Such that:

Make z the subject

For their product to be maximum, we have:

Substitute
in 

Open bracket

Differentiate w.r.t x and y


Since the products are maximum, then 
For 

Factorize:

Split

Make y the subject

For 

---------------------------------------------------
Substitute y = 0


Factorize



---------------------------------------------------
Substitute 



Re-arrange


Factor x out

Divide through by x



Recall that: 


Take LCM


Recall that:


Take LCM


Hence, the numbers are:
