Answer:
Step-by-step explanation:
The last one is also the answer
Using the rational exponet rule,
![\sqrt[n]{ {x}^{m} } = x {}^{ \frac{m}{n} }](https://tex.z-dn.net/?f=%20%5Csqrt%5Bn%5D%7B%20%7Bx%7D%5E%7Bm%7D%20%7D%20%20%3D%20x%20%7B%7D%5E%7B%20%5Cfrac%7Bm%7D%7Bn%7D%20%7D%20)
Using this number,
40 is the base so it will stay same. Remember this is a square root sign so our nth root is 2 so our denominator if the rational exponet is 2.
so our numerator is 1 so
The slope will be -3/4
To find slope you just place the change in y over the change in x.
2- -1=3
0-4= -4
The slope is -3/4 which is the same as before
Answer:
-2
Step-by-step explanation:
We can find the slope of a line given two points from
m = (y2-y1)/(x2-x1)
= (-2-4)/(1--2)
= (-6)/(1+2)
=-6/3
=-2
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
