Step-by-step explanation:
All steps are in pic above.
<u>N</u><u>o</u><u>t</u><u>e</u><u>:</u><u>i</u><u>f</u><u> </u><u>y</u><u>o</u><u>u</u><u> </u><u>h</u><u>a</u><u>v</u><u>e</u><u> </u><u>a</u><u>n</u><u>y</u><u> </u><u>questions</u><u> </u><u>a</u><u>b</u><u>o</u><u>u</u><u>t</u><u> </u><u>i</u><u>t</u><u> </u><u>l</u><u>e</u><u>t</u><u> </u><u>m</u><u>e</u><u> </u><u>k</u><u>n</u><u>o</u><u>w</u><u>.</u>
There's only one step to solve this problem (that's if you're looking for it)
Because,
Answer:
C. 75
Step-by-step explanation: