Answer:
its A
Step-by-step explanation:
have you smiled today? its very important:)
Answer:
3
Step-by-step explanation:
In probability, problems involving arrangements are called combinations or permutations. The difference between both is the order or repetition. If you want to arrange the letters regardless of the order and that there must be no repetition, that is combination. Otherwise, it is permutation. Therefore, the problem of arrange A, B, C, D, and E is a combination problem.
In combination, the number of ways of arranging 'r' items out of 'n' items is determined using n!/r!(n-r)!. In this case, you want to arrange all 5 letters. So, r=n=5. Therefore, 5!/5!(505)! = 5!/0!=5!/1. It is simply equal to 5! or 120 ways.
Answer:
You can either do a back to back stem and leaf plot, where you would have double the values. In a normal stem and leaf plot you would just have one set of 3's where you would put all the values that start with 3 in that column. A back to back is the same but instead you would have two 3 values, where anything that is higher than 5 would be in the second value of 3, but anything lower would be in that first value of 3.
