Answer:
the number of possibilities that can be drace himself up for the day is 216
Step-by-step explanation:
Given that
jun has 12 t-shirts,6 pairs of pants and 3 pairs of shoes
We need to find out the possibilities that can be drace himself up for the day
So here

Hence, the number of possibilities that can be drace himself up for the day is 216
The same would be considered and relevant too
Answer:

Step-by-step explanation:
Starting from the y-intercept of
you do
by either moving four blocks <em>south</em><em> </em>over one block <em>west</em><em> </em>or four blocks <em>north</em><em> </em>over one block<em> east</em><em> </em>[<em>west</em> and <em>south</em> are negatives]. Next, we have to determine the types of inequality symbols that are suitable for this graph, which will be <em>less</em><em> </em><em>than</em><em> </em>and <em>greater</em><em> </em><em>than</em><em> </em>since this is a <em>dashed</em><em> </em><em>line</em><em> </em>graph. We then use the zero-interval test [test point (0, 0)] to ensure whether we shade the opposite portion [portion that does not contain the origin] or the portion that DOES contain the origin. At this step, we must verify the inequalities as false or true:
<em>Greater</em><em> </em><em>than</em>
☑
<em>Less</em><em> </em><em>than</em><em> </em>
![\displaystyle 0 < 4[0] - 2 → 0 ≮ -2](https://tex.z-dn.net/?f=%5Cdisplaystyle%200%20%3C%204%5B0%5D%20-%202%20%E2%86%92%200%20%E2%89%AE%20-2)
This graph is shaded in the portion of the origin, so you would choose the <em>greater</em><em> </em><em>than</em><em> </em>inequality symbol to get this inequality:

I am joyous to assist you anytime.