Answer:
End result is ln(-x) + 1
Step-by-step explanation:
1,  ln x + 2
2. ln(x + 2) + 2
3. ln(x + 2 - 2) + 2 = ln x + 2
4. ln x + 1
5. ln(-x) + 1
 
        
                    
             
        
        
        
The solution is:A mole of gas occupies 22.4 L A liter is 1000 cubic centimeters because 1 cubic centimeter = 1 mL
One Helium molecule (essentially one helium atom) has atomic mass 4 g/mol So for every 22400 cubic centimeters of volume, we have 4 grams of helium Density of helium = 4g / 22400 cm^3 = 1g / 5600 cm^3 
Volume of a sphere = (4/3)(pi)r^3 Volume of the outside sphere (the entire sphere) is (4/3)(pi)(R+T)^3 Volume of the inside sphere (the hollow region) is (4/3)(pi)R^3 
The difference for the volume of silver. (4/3)(pi)(R+T)^3 - (4/3)(pi)R^3 = (4/3)(pi)(3R^2T + 3RT^2 + T^3) 
The density of silver is 10.5g/cm^3 
So the mass of the silver is computed by:10.5*(4/3)(pi)(3R^2T + 3RT^2 + T^3) = (14*pi)(3R^2T + 3RT^2 + T^3) = (14pi)T(3R^2 + 3RT + T^2) 
Now for the mass of helium: volume x density = (4/3)(pi)R^3 (1/5600) = (pi/4200)R^3 
Set the two masses equal: (pi/4200)R^3 = (14pi)T(3R^2 + 3RT + T^2) R^3 = 58800*T(3R^2 + 3RT + T^2) R / T = 58800*(3R^2 + 3RT + T^2) / R^2 = 58800*( 3+T/R^2+(T/R)^2) 
then solve for xx = T / R 1/x = 58800*( 3+x/R+x^2) 1/58800 = x (3 + x/R + x^2) 1/58800 = 3x + x^3 x^3 + 3x - 1/58800= 0 x = ~ 5.66893x10^(-6)
        
             
        
        
        
The shape of a bst approaches that of a perfectly balanced binary tree, (log2n) is the time complexity for a balanced binary search tree in case of insertions and search.
In computing, binary bushes are mainly used for looking and sorting as they offer a way to save statistics hierarchically. a few common operations that may be conducted on binary trees encompass insertion, deletion, and traversal.
A binary tree has a special situation that each node could have a most of two youngsters. A binary tree has the benefits of each an ordered array and a linked listing as search is as brief as in a taken care of array and insertion or deletion operation are as fast as in related listing.
In pc science, a binary tree is a tree information shape in which every node has at maximum two youngsters, that are known as the left baby and the proper toddler.
Learn  more about binary trees here brainly.com/question/16644287
#SPJ4
 
        
             
        
        
        

Shift the graph of the function y = x², 5 units down /look at the picture #1/.
 /look at the picture #2/ - your answer
 /look at the picture #2/ - your answer