Given a matrix where every cell has some number of coins. count number of ways to reach bottom right from top left with exactly k coins. we can move to (i+1, j) and (i, j+1) from a cell (i, j).

answer: 1 and 3

step-by-step explanation:

step-by-step explanation:

given that there are two triangles j'k'l' and jkl>

the former is got by dilating the second one.

when drawn on a grid, (graph paper) coordinates of vertices of first triangle is

(6,12)j, (9,6)k and (12,9)l

side jk has length = distance between j and k

=

side j'k'=distance between j' and k'

=

ie j'k'l' has sides 1/3 of that of corresponding sides of jkl.

hence scale factor of 1/3 is used to get j'k'l'from jkl

so what is the problem what are they asking you to solve

step-by-step explanation:

so what is the problem what are they asking you to solve

step-by-step explanation:

i found the koficent of the linear function and i foun c acordind to the strict formula y=kx+c and then i took 2 as an x and replacet it on the formula i found and then foun the y