Answer:
Pretty sure it would be the last one.
Not sure if you want me to do the work. All I can say is that it would be<em> very long.</em>
Answer:
c
Step-by-step explanation:
Answer:

Step-by-step explanation:
For this case in order to select the one admiral, captain and commander, all different. We are assuming that the order in the selection no matter, so we can begin selecting an admiral then a captain and then a commander.
So we have 10C1 ways to select one admiral since we want just one
Now we have remaining 9 people and we have 9C1 ways to select a captain since we want a captain different from the admiral selected first
Now we have remaining 8 people and we have 8C1 ways to select a commander since we want a commander different from the captain selected secondly.
The term nCx (combinatory) is defined as:

And by properties 
So then the number of possible way are:

If we select first the captain then the commander and finally the admiral we have tha same way of select 
For all the possible selection orders always we will see that we have 720 to select.
Answer: <em>1=60°</em>
Step-by-step explanation:
<em>First, let's take our given angle of 30°</em>
<em>30° is in a right triangle, so the angles must be 90°, 60°, and 30°</em>
<em>Now the angle that is 45° makes angle 1 congruent to angle 60°</em>
<em>Meaning angle 1 is </em><em>60°</em>