Answer:
(2,6)
Step-by-step explanation:
<u><em>The options of the questions are</em></u>
(0,1) (1,3) (2,6) (3,27)
and the given function is 
we know that
If a ordered pair lie on the graph of the given equation, then the ordered pair must satisfy the given equation
<u><em>Verify each ordered pair</em></u>
case 1) (0,1)
substitute the value of x and the value of y in the linear equation and then compare the results
----> is true
so
The ordered pair lie on the graph of the given equation
case 2) (1,3)
substitute the value of x and the value of y in the linear equation and then compare the results
----> is true
so
The ordered pair lie on the graph of the given equation
case 3) (2,6)
substitute the value of x and the value of y in the linear equation and then compare the results
----> is not true
so
The ordered pair not lie on the graph of the given equation
case 4) (3,27)
substitute the value of x and the value of y in the linear equation and then compare the results
----> is true
so
The ordered pair lie on the graph of the given equation
Answer:
28
Step-by-step explanation:
f(6) = -3 * 6 + 10 = -18 + 10 = -8
g(f(6)) = g(-8)
g(-8) = 
= 64 - 24 - 12 = 64 - 36 = 28
Hello!
First you have to find the surface area of what he is painting
Finding the areas of all the rectangles he is painting
14 * 8 = 112
14 * 8 = 112
12 * 8 = 96
12 * 8 = 96
12 * 14 = 168
Add all these up
112 + 112 + 96 + 96 + 168 = 584
Divide this by the amount of area a pint of paint covers
584 / 90 = 6.4888...
He needs 7 pints of paint because he needs more than 6
Multiply this by the cost of 1 pint of pint
7 * 7.98 = 55.86
The answer is $55.86
Hope this helps!
Answer:
People often sort stacks of documents using a recursive method. For example, imagine you are sorting 100 documents with names on them. First place documents into piles by the first letter, then sort each pile. Looking up words in the dictionary is often performed by a binary-search-like technique, which is recursive.
Step-by-step explanation:
This is just an example.
If this helps please mark as brainliest
