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
Alja [10]
2 years ago
9

Please help me with this math problem (image below)

Mathematics
1 answer:
VashaNatasha [74]2 years ago
6 0

Answer:

Option B.

Step-by-step explanation:

Obvious. <u>Lets explain:</u>

<em>Option A: It's pretty ease to do. You just need 2 triangles to make a parallelogram, and that's that.</em>

<em>Option B: How can you make a rectangle from triangles-???</em>

<em>Option C: You might think I am wrong, but I am right. Get 6 triangles, then plato, you have a whole hexagon!</em>

<em>Option D: You probably already know this...but you just need three triangles.</em>

It's correct on every school thing.

<h2>Option B is your answer!</h2>
You might be interested in
Three neighbors plan to complete fencing projects this spring. As shown in the diagrams below, Neighbor A plans to fence in his
diamong [38]

Answer:

i think c

Step-by-step explanation:

6 0
2 years ago
18 is what__ % of 30.
Nostrana [21]
18/30=?/100

18 times 100 = 1800

1800 divided by 30

60%
3 0
3 years ago
Using the Breadth-First Search Algorithm, determine the minimum number of edges that it would require to reach
jekas [21]

Answer:

The algorithm is given below.

#include <iostream>

#include <vector>

#include <utility>

#include <algorithm>

using namespace std;

const int MAX = 1e4 + 5;

int id[MAX], nodes, edges;

pair <long long, pair<int, int> > p[MAX];

void initialize()

{

   for(int i = 0;i < MAX;++i)

       id[i] = i;

}

int root(int x)

{

   while(id[x] != x)

   {

       id[x] = id[id[x]];

       x = id[x];

   }

   return x;

}

void union1(int x, int y)

{

   int p = root(x);

   int q = root(y);

   id[p] = id[q];

}

long long kruskal(pair<long long, pair<int, int> > p[])

{

   int x, y;

   long long cost, minimumCost = 0;

   for(int i = 0;i < edges;++i)

   {

       // Selecting edges one by one in increasing order from the beginning

       x = p[i].second.first;

       y = p[i].second.second;

       cost = p[i].first;

       // Check if the selected edge is creating a cycle or not

       if(root(x) != root(y))

       {

           minimumCost += cost;

           union1(x, y);

       }    

   }

   return minimumCost;

}

int main()

{

   int x, y;

   long long weight, cost, minimumCost;

   initialize();

   cin >> nodes >> edges;

   for(int i = 0;i < edges;++i)

   {

       cin >> x >> y >> weight;

       p[i] = make_pair(weight, make_pair(x, y));

   }

   // Sort the edges in the ascending order

   sort(p, p + edges);

   minimumCost = kruskal(p);

   cout << minimumCost << endl;

   return 0;

}

8 0
3 years ago
9+10=?<br> A. 21<br> B. 4<br> C. 19<br> D. 18
snow_tiger [21]
The answer is c because if you have 9 legos and your friends gives you 10 You have now 19 legos
8 0
3 years ago
Read 2 more answers
A number divided by 6 is 18​
m_a_m_a [10]

Answer:

108

Step-by-step explanation:

x=number

X

___. = 18

6

Multiply 6 on both sides to get X by itself

18x6=108

x=108

4 0
3 years ago
Read 2 more answers
Other questions:
  • Given the triangle below find each of the requested values
    10·1 answer
  • Are the triangles similar? if they are, write a similarity statement and give the scale facter.
    8·1 answer
  • Anyone know the answer?
    13·1 answer
  • Fill the blank<br><br> ___sinb=(1)/(2)[sin(a+b)-sin(a-b)]<br><br> There are no answer choices
    14·1 answer
  • What is the gcf of 19 and 45?
    10·1 answer
  • I dont have anything to say..
    12·2 answers
  • Graph: <br> Y=X +3 squared -4
    7·1 answer
  • Please help!!!!!!!!!!!!!!!!!!!!!!!!
    8·1 answer
  • Does someone knows how to do this one?
    14·1 answer
  • -8 + 4 is equivalent to?<br><br> -12<br> 12<br> -4<br> 4
    6·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!