1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
andreyandreev [35.5K]
2 years ago
5

Which shows the expression below simplified?

Mathematics
1 answer:
patriot [66]2 years ago
6 0

Answer:

a

Step-by-step explanation:

You might be interested in
What is the slope of y=5/2x - 4. and what is the y intercept
miskamm [114]

Answer:

Slope is 2/3

y-intercept is 1

Step-by-step explanation:

4 0
2 years ago
Read 2 more answers
Butter and flour are mixed in the ratio 2 : 3.Chris has 640 grams of butter and 880 grams of flour.How much more flour does he n
VMariaS [17]

he need 1000 grams of all

3 0
3 years ago
PLEASE HELP <br> If I buy 24 tickets for 25 cents each how much money did I spend?
Vladimir [108]

Answer:

$6.00

Step-by-step explanation:

3 0
2 years ago
Read 2 more answers
Find the angles marked with letters. <br>Please help!! ​
Paladinen [302]
A=34°
B=76°
C and d = 70°
because a triangle is 180° and we know
a+b+c=180
76+34=110
180-110=70
3 0
2 years ago
"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
Other questions:
  • What is 5.96 as a fraction
    7·1 answer
  • A scientist working with 0.9 M of gold wire how long is the wire in millimeters?
    13·1 answer
  • The flower color of bigleaf hydrangeas is determined by the soil's pH. A gardener growing blue hydrangeas believes that lime may
    6·1 answer
  • There are 58 students enrolled in an art class. The day before the class begins, 10.3% of the students cancel. How many students
    8·1 answer
  • Using the numbers -4, 10, 8, 2, -3, -5, create two expressions that<br> equal 6.
    6·1 answer
  • Identify the conic section of xy=4
    9·1 answer
  • Why do you think the two empires did not last very long?​
    8·1 answer
  • Translate each expression
    15·1 answer
  • 6. What is the first step when looking at a data set?
    9·1 answer
  • Find the equation of the line that
    14·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!