![8 < \sqrt[3]{a} < 9](https://tex.z-dn.net/?f=8%20%3C%20%5Csqrt%5B3%5D%7Ba%7D%20%3C%209)

So, a can be any number between (512, 729).
∴ answer is (A) 679
Answer:
The point that maximizes the objective function is (3,0)
Step-by-step explanation:
we have
Constraints:

Using a graphing tool
The feasible region is the shaded area
see the attached figure
The vertices of the feasible region are
(0,0),(0,1),(1.5,1.5) and (3,0)
we know that
To find the point in the feasible region that maximizes the objective function, replace each ordered pair of vertices in the objective function and then compare the results.
The objective function is

For (0,0) -----> 
For (0,1) -----> 
For (1.5,1.5) -----> 
For (3,0) -----> 
therefore
The point that maximizes the objective function is (3,0)
It’s simplified as far as it can be. it’s not factorable either
<span>Thomas rented 2 bicycles, which were late for return by 6 days. His fine for being late was 18$. If the fine for being late is count by multiplying the number of bicycles with the duration of the late, the answer would be:
fine = number of bicycle * duration of late
$18 =fine rate* 2 bicyles * 6 days
fine rate= (($18/ 2 bicyles) / 6 days) = $0.66 /bicycle days</span>