Let a and b be arbitrary 3 x 3 matrices. state "true" or "false" for each of the following statements. you do not need to justify your answers. (a) if a = -5, then a is invertible. (b) if ab = 0, then at least one of a and b must be zero. (c) if a = 0 and b = 0, then a + b = 0. (d) if |a= 0 and bi = 0, then |ab| = 0. (e) 3a = 3 a. (f) - a = -al. (g) |a| = |a. (h) if every entry of a is positive, then a is positive. (i) if every entry of a is an integer, then al is an integer. (1) a + b

answer: 1,380

step-by-step explanation:

1: you turn %15 into a decimal by moving the decimal point two places to the left.

2: and then you multiply .15 by 1,200 , which will get you 180.00

3: from there you will add 180 to 1,200

4: which will get you 1,380

hope it *im kind of slow so idk if my answer is right*

so firstly, we need to isolate the y variables to be able to solve these inequalities. firstly, add 0.5x on both sides of the first inequality and subtract 1.5x on both sides of the second inequality:

now since the slope is positive for the first inequality, this means that the line going upwards belongs to the first inequality, and the line going downwards belongs to the second inequality.

next, since y ≥ in the first inequality, this means that the shaded region will be above the first inequality's line, thus shading regions a and b.

next, since y ≤ in the second inequality, this means that the shaded region is going to be below this line, thus shading regions a and c.

since both lines shade region a, this means that region a is the solution.

step-by-step explanation:

mark brainliest!

the answer is c 150

step-by-step explanation:

step-by-step explanation:

your answer is a