Answer:
Permutation
Step-by-step explanation:
Since we are talking about passwords the order of the letters matters, i.e, the pasword UpT is different to the pasword pUT. Therefore, the problem involves all the permutations of 33 letters, from the given letters, where no repetitions of letters are allowed.
What do you mean fhejekjevdje
Answer:
midpoint m= <u>(</u><u>x1 </u><u>+</u><u>x2</u> , <u>y1 </u><u>+</u><u> </u><u>y2</u><u>)</u>
2. 2
Step-by-step explanation:
M =(<u>0</u><u>+</u><u>2</u><u>. </u>, <u>0</u><u>+</u><u>2</u><u>)</u>
2. 2
M=(1,1)
