Answer:
D)
24
Step-by-step explanation:
Easy peasy
just use PEMDAS and some exonential laws



also another is
![x^{\frac{m}{n}}=\sqrt[n]{x^{m}}](https://tex.z-dn.net/?f=%20x%5E%7B%5Cfrac%7Bm%7D%7Bn%7D%7D%3D%5Csqrt%5Bn%5D%7Bx%5E%7Bm%7D%7D%20)
so
![[3(2a)^{\frac{3}{2}}]^{2}](https://tex.z-dn.net/?f=%20%5B3%282a%29%5E%7B%5Cfrac%7B3%7D%7B2%7D%7D%5D%5E%7B2%7D%20)
=

=

=

=

=

=
1. 5 and E, 6 and F, 7 and D, 8 and A, 9 and G
Answer:
1000 cm²
Step-by-step explanation:
Given:
- Length = 10 cm
- Width = 12.5 cm
- Height = 8 cm
<u>Formula:</u>

Substitute the length, width, and the height of the prism to determine the volume of the prism.

Simplify the right hand side of the equation, as needed;



Therefore, the volume of the prism is 1000 cm².
There are eight cities on the list.
The number of groups of 2 is (8·7)/2 = 28
The number of groups of 3 is (8·7·6)/(3!) = 56
The number of groups of 4 is (8·7·6·5)/(4!) = 70
The number of groups of 5 is (8·7·6·5·4)/(5!) = 56
The number of groups of 6 is (8·7·6·5·4·3)/(6!) = 28
The number of groups of 7 is (8·7·6·5·4·3·2)/(7!) = 8
So there are (28+56+70+56+28+8) = 246 ways to visit "some" of them.
There's only one way to visit "all" of them, and
there's only one way to visit "none" of them.
So, all together, Louise has 248 travel options.
If she decides to visit Chicago, I will show her a good time.