Answer:

![\sqrt[3]{0.95} \approx 0.9833](https://tex.z-dn.net/?f=%5Csqrt%5B3%5D%7B0.95%7D%20%5Capprox%200.9833)
![\sqrt[3]{1.1} \approx 1.0333](https://tex.z-dn.net/?f=%5Csqrt%5B3%5D%7B1.1%7D%20%5Capprox%201.0333)
Step-by-step explanation:
Given the function: ![g(x)=\sqrt[3]{1+x}](https://tex.z-dn.net/?f=g%28x%29%3D%5Csqrt%5B3%5D%7B1%2Bx%7D)
We are to determine the linear approximation of the function g(x) at a = 0.
Linear Approximating Polynomial,
a=0
![g(0)=\sqrt[3]{1+0}=1](https://tex.z-dn.net/?f=g%280%29%3D%5Csqrt%5B3%5D%7B1%2B0%7D%3D1)

Therefore:

(b)![\sqrt[3]{0.95}= \sqrt[3]{1-0.05}](https://tex.z-dn.net/?f=%5Csqrt%5B3%5D%7B0.95%7D%3D%20%5Csqrt%5B3%5D%7B1-0.05%7D)
When x = - 0.05

![\sqrt[3]{0.95} \approx 0.9833](https://tex.z-dn.net/?f=%5Csqrt%5B3%5D%7B0.95%7D%20%5Capprox%200.9833)
(c)
(b)![\sqrt[3]{1.1}= \sqrt[3]{1+0.1}](https://tex.z-dn.net/?f=%5Csqrt%5B3%5D%7B1.1%7D%3D%20%5Csqrt%5B3%5D%7B1%2B0.1%7D)
When x = 0.1

![\sqrt[3]{1.1} \approx 1.0333](https://tex.z-dn.net/?f=%5Csqrt%5B3%5D%7B1.1%7D%20%5Capprox%201.0333)
Answer:
(-1.5, 0) and (0, -6)
Step-by-step explanation:
Answer:
1st,4th,5th option.
Step-by-step explanation:
Let evaluate each option.
A segment bisector is a line segment, ray, and/or line that bisects a line into two congruent parts. LM splits JK and KH into congruent parts. The first option is correct.
A perpendicular bisector is a line segment,ray and/or line that intersects a line segment,ray at a right angle. We don't have a perpendicular angle here and so that isn't a option.
M isn't a vertex of congruent angles as there is none in this figure.
The fourth and fifth option are correct. They both are on the segment bisector so they split the figure segments into two congruent parts. Since they are on the line segment and bisects it, they are considered the midpoint or middle point of the figure side.
There are 24 ways in which 5 guys can sit if arranged from oldest to youngest.
We have,
Five guys.
Now,
We know that,
Total number of ways to arranged around a table (n) = (n-1)!
So,
For n = 5,
I.e.
(n - 1)! = (5 - 1)! = 4!
So,
Total number of ways to arranged Five guys rom oldest to youngest (n) = (n-1)!
i.e.
= (5 - 1)! = 4!
We get,
= 4 × 3 × 2 × 1
i.e.
Total number of ways to arranged Five guys rom oldest to youngest (n) = 24.
Hence we can say that there are 24 ways in which 5 guys can sit if arranged from oldest to youngest.
Learn more about arrangement here
brainly.com/question/15032503
#SPJ4