Urgent, please answer and show your work. In how many ways can two bishops be placed on a chessboard so that they do not attack each other? Note: a bishop can move any number of squares diagonally. A bishop on a white square, therefore, moves along white squares only. A bishop on a black square moves diagonally along black squares only.

use the formula of permutation and combination

Step-by-step explanation:

ad = ae + ed = y + 7

similar triangles therefor

ac/ab = ad/ae

6/4 = (y + 7) / y

cross multiply

6y = 4(y + 7)

6y = 4y + 28

2y = 28

y = 14

step-by-step explanation:

(d)

step-by-step explanation:

given: the line in the graph passes through points (5,30) and (6,26).

then, the equation of line is:

now, put y=a(n) and x=n,

hence, option d is correct.