Why should a combination lock” actually be called a “ permutation lock”? Provide some examples of combinations and permutations that you use to remember which is which

Step-by-step explanation:

Well irs a pertuation lock because you are making a unique combination that only you know and an example of this is like 12395 or 9583644 those two are combinations and there are aproximately 64,000e12 combinations

add an image !

step-by-step explanation:

option 2 is correct.

step-by-step explanation:

we are given two inequality equation

x+y> 5 and -3x+2y< -2

first we draw the graph of both function using t-table method

equation: x+y> 5

for x=0, y=5

for x=-5, y=0

table:

x   :   0     5

y   :   5     0

test point (0,0) , 0> 5

false

equation: -3x+2y< -2

for x=0, y=-1

for x=2, y=4

table:

x   :   0     2

y   : -1       4

test point (0,0) , 0< -2

true

now we draw the graph. see the attachment for graph.

common region would be solution set.

option 2 is correct.