How many times will the innermost loop be iterated when the algorithm segment is implemented and run? Assume n, k, j, and i are positive integers. for k := 1 to n for j := k to n for i := j to n [Statements in the body of the inner loop, none containing branching statements that lead outside the loop] next i next j next k

many reason,

step-by-step explanation:

look at the picture.

1.

ef : ab = 2 : 3

gf : cb = 2 : 3

gh : cd = 2 : 3

he : da = 2 : 3

2.

∠a ≅ ∠e

∠b ≅ ∠f

∠c ≅ ∠g

∠d ≅ ∠h

3.

use pythagorean theorem:

the length of the abcd trapezoid sides:

|ab| = 3 cm

|bc| = 10 cm

|cd| = 3(3) cm = 9 cm

|da| = 8 cm

the perimeter of abcd = 3 + 10 + 9 + 8 = 30 cm

the ratio of perimeters of the tarapezoids is equal 2 : 3.

substitute:

      cross multiply

      divide both sides by 3

answer: the answer is 100 x 12,500, which is 1,250,000.

step-by-step explanation: emily solved for a part when she should have solved for the whole.  

875,000 should be the numerator of the equivalent ratio.  

70 x 12,500 is 875,000.  

step-by-step explanation: