Answer:
Standard y=1
Slope Intercept y=2x-3
Step-by-step explanation:
-3y = -3
divide both sides by -3
y=1
8x-4y=12
move variable to the right -4y=12-8x
divide both sides by 4 y = -3+2x
Answer:
Option C is correct.
Step-by-step explanation:
Given Equation:
![\frac{5}{3b^3-2b^2-5}=\frac{2}{b^3-2}](https://tex.z-dn.net/?f=%5Cfrac%7B5%7D%7B3b%5E3-2b%5E2-5%7D%3D%5Cfrac%7B2%7D%7Bb%5E3-2%7D)
To find: Solution of the Equation.
Consider,
![5(b^3-2)=2(3b^3-2b^2-5)](https://tex.z-dn.net/?f=5%28b%5E3-2%29%3D2%283b%5E3-2b%5E2-5%29)
![5b^3-10=6b^3-4b^2-10](https://tex.z-dn.net/?f=5b%5E3-10%3D6b%5E3-4b%5E2-10)
![6b^3-5b^3-4b^2+10-10=0](https://tex.z-dn.net/?f=6b%5E3-5b%5E3-4b%5E2%2B10-10%3D0)
![b^3-4b^2=0](https://tex.z-dn.net/?f=b%5E3-4b%5E2%3D0)
![b^2(b-4)=0](https://tex.z-dn.net/?f=b%5E2%28b-4%29%3D0)
b² = 0 ⇒ b = 0
b - 4 = 0 ⇒ b = 4
Therefore, Option C is correct.
Cube root of six squared
denominator becomes the index, the cube part
numerator status as the exponent of the base
Answer:
Step-by-step explanation:
a.) The worst-case height of an AVL tree or red-black tree with 100,000 entries is 2 log 100, 000.
b.) A (2, 4) tree storing these same number of entries would have a worst-case height of log 100, 000.
c.) A red-black tree with 100,000 entries is 2 log 100, 000
d.) The worst-case height of T is 100,000.
e.) A binary search tree storing such a set would have a worst-case height of 100,000.