Let m be an n × n matrix with each entry equal to either 0 or 1. let mij denote the entry in row i and column j. a diagonal entry is one of the form mii for some i. swapping rows i and j of the matrix m denotes the following action: we swap the values mik and mjk for k = 1, 2, . . , n. swapping two columns is defined analogously. we say that m is rearrangeable if it is possible to swap some of the pairs of rows and some of the pairs of columns (in any sequence) so that, after all the swapping, all the diagonal entries of m are equal to 1. (a) give an example of a matrix m that is not rearrangeable, but for which at least one entry in each row and each column is equal to 1. (b) give a polynomial-time algorithm that determines whether a matrix m with 0-1 entries is rearrangeable.

goog may have it for you

the answer would be d

straight away you can eliminate a and c because not all books contain a scientific skill because some may be fiction. c is also wrong because it saids that the only way children can learn is through books which is incorrect.

b is also wrong because reading can be a scientific skill but not always, therefore it is wrong which leaves you with d, the correct answer since it said that it can children learn.

hope this ! : 3

2 apples

step-by-step explanation:

taking away equals subtraction. 6-4=2

b

step-by-step explanation:

the equation of a line in point- slope form is

y - b = m(x - a)

where m is the slope and (a, b) a point on the line

calculate m using the slope formula

m = (y₂ - y₁ ) / (x₂ - x₁ )

with (x₁, y₁ ) = (0, 4) and (x₂, y₂ ) = (3, - 5) ← 2 points on the line

m = = = - 3

with m = - 3 and (a, b) = (3, - 5), then

y - (- 5) = - 3(x - 3), that is

y + 5 = - 3(x - 3) → b