Given integers n and k, along with p1, pn; where pi ε [0, 1], you want to determine the probability of obtaining exactly k heads when n biased coins are tossed independently at random, where pi is the probability that the ith coin comes up heads. give an o(n2) algorithm for this task. assume you can multiply and add two numbers in [0, 1] in o(1) time.

the answer is a reflection across the line m

step-by-step explanation:

on edge

solution:

we have to construct

∠m nt ≅ ∠p qr

the steps to draw this construction are

step 1: use a compass to draw an arc from point q which intersects the side pq at point a and the side qr at point b.

step 2: draw a segment nt and use the same width of the compass to draw an arc from point n which intersects the segment nt at a point x.

step 3:

step 4: join points n and y using a straightedge.

step 3:

option (d).maintaining the same width of the compass as ab, draw an arc from point x such that it intersects the arc drawn from n in a point y.

to draw   congruent angles , 1. width of compasses while drawing two angles should be same i.e from point at which angle has to be drawn, 2.the distance between the two points where the compass intersects the two sides should be same while drawing any two congruent angles.

step-by-step explanation:

38.6°

step-by-step explanation:

resultant is 10 pound

smaller force = 8 pound

angle formed = tan⁻¹(

                        =tan⁻¹(

                          =tan⁻¹(0.8)

                        =38.6°