Answer:
1. Annual demand ( D) = 100,000 bags
Ordering cost per order (Co) = $15
Holding cost per item per annum (H) = 15% x $2 = $0.30
EOQ = √<u>2DCo</u>
H
EOQ = √<u>2 x 100,000 x $15</u>
0.30
EOQ = 3,162 units
2. Maximum inventory
= Safety stock + EOQ
= 1,500 + 3,162
= 4,662 units
3. Average inventory
= EOQ/2
= <u>3,162</u>
2
= 1,581 units
4. Number of order
= <u>Annual demand</u>
EOQ
= <u>100,000</u>
3,162
= 32 times
Explanation:
EOQ is the square root of 2 multiplied by annual demand and ordering cost per order divided by holding cost per item per annum.
Maximum inventory is the aggregate of safety stock and EOQ.
Average inventory is economic order quantity divided by 2
Number of order is the ratio of annual demand to economic order quantity.
The family of the boy will most likely sue the Gregors for not putting a fence around the pool in their backyard due to which their child has been injured.
<h3>What is a fence?</h3>
A fence is a structure built outside an area to cover it so that no one can escape or enter that area. It is a kind of a railing or a barrier usually made up of wood, wire, or steel bars.
If the Gregor family has put the fence around the pool in their backyard, then a ten-year-old boy can't able to enter the pool area which ultimately results in no injury to the boy. But the Gregor family has denied putting the fence which makes the ten-year-old injured when he jumps into the pool area.
Therefore, the injured boy's family will sue the Gregor family for not putting a fence around the pool area.
To learn more about the Gregor family in the mentioned link:
brainly.com/question/10680266
#SPJ1
A.Americans prefer to have the market, rather than the government, to manage their economy.
Solution:
Given :
Location game with 9 possible 
and other than the players who are moving simultaneously and also independently, but they move in a sequential manner.
Vendor 1 selects a location.
After observing decision of vendor 1, vendor 2 chooses where to locate.
Using backward induction the game is solved as below :
-- 
will be a Nash equilibrium.
-- Presently 
(vendor 1) picks first then he will likewise get the chance to pick last as this another move amusement.
-- In the end of the game, vendor 1 will have claimed five regions and candidate 2 (vendor 2) will have claimed four regions.
-- So vendor 2 will keep this in mind and apply backward induction and choose the best regions early on the game.
-- Vendor 2 will keep in mind that vendor 1 will choose last and will ensure that his choices take up the best locations first.
--- This will be his ideal technique for each activity of vendor 1.
Hence this is the Nash equilibrium.
