Suppose that a>b>1, then
and 
Therefore, since 2<3<7, 
Choose an arbitrary x>1. You have that a takes the greatest values at x, c takes the smallest value at x. Thus,
a>b>c and
Answer: correct option is B.
Ummmmmm whatttt I’m confuseddd
<em>Look</em><em> </em><em>at</em><em> </em><em>the</em><em> </em><em>attached</em><em> </em><em>picture</em><em> </em><em>⤴</em>
<em>Hope</em><em> </em><em>it</em><em> </em><em>will</em><em> </em><em>help</em><em> </em><em>u</em><em>.</em><em>.</em><em>.</em>
<em>✴</em><em>Have</em><em> </em><em>a</em><em> </em><em>great</em><em> </em><em>day</em><em>✴</em><em>✴</em>
Step-by-step explanation:
There are 7 books that can go in the first spot.
After a book has been placed in the first spot, there are 6 books left that can go in the second spot.
After that, there are 5 books that can go in the third spot.
So on and so forth.
So the number of ways is:
7×6×5×4×3×2×1 = 7! = 5040
Answer:
D
Step-by-step explanation: