I will you brainiest if you can answer this

Michelle will be 72 years old in eighteen years. How old is Michelle now? A. 90 years old B. 54 years old C. 36 years old D. 49

Katen [24]

Subtract 18 from 72 to get Michelle's current age.

72 - 18 = 54

5 0

3 years ago

Read 2 more answers

Please help with this question i will mark you brainliest!

adell [148]

9514 1404 393

Answer:

equation: y = 4x

graph is attached

Step-by-step explanation:

Let y represent the cost of the peaches in dollars. Let x represent their weight in pounds. Then the relation between the two variables is ...

cost = (cost per pound) × (pounds)

y = 4x

__

This graphs as a line through the origin with a slope of 4. In the attached, the x- and y-axes have different scales so more of the graph can be seen.

8 0

2 years ago

HELP ME PLWASE ITS A TEST <br>

cupoosta [38]

Answer:

1/3 you will add it to get your main description and get your final answer

4 0

3 years ago

MARKING AS BRAINLIEST!! Starr if given functions are inverse)!

Kitty [74]

Answer: They are inverses of each other

==========================================================

Explanation:

We'll need to compute h(f(x)) and f(h(x)) to see if we get x each time.

$h(x) = 9x-4\\\\h(f(x)) = 9(f(x))-4\\\\h(f(x)) = 9\left(\frac{x+4}{9}\right)-4\\\\h(f(x)) = x+4-4\\\\h(f(x)) = x\\\\$

and,

$f(x) = \frac{x+4}{9}\\\\f(h(x)) = \frac{h(x)+4}{9}\\\\f(h(x)) = \frac{9x-4+4}{9}\\\\f(h(x)) = \frac{9x}{9}\\\\f(h(x)) = x\\\\$

Both composite functions lead to x each time.

The equations h(f(x)) = x and f(h(x)) = x being true means each function is the inverse of the other.

5 0

2 years ago

Read 2 more answers

"3. When we have two sorted lists of numbers in non-descending order, and we need to merge them into one sorted list, we can sim

iren [92.7K]

Answer:

Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)

Step-by-step explanation:

To understand better how we arrived at the aforementioned algorithm, we take it step by step

a, Construct a min-heap of the minimum elements from each of "k" lists.

The creation of this min-heap will cost O (k) time.

b) Next we run delete Minimum and move the minimum element to the output array.

Each extraction takes O (log k) time.

c) Then insert into the heap the next element from the list from which the element was extracted.

Now, we note that since we extract n elements in total, the running time is

O (n log k+ k) = O (n log k).

So we can conclude that :

Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)

5 0

3 years ago