Question: 2. Determine how many paths will spell PERMUTATION if you start at the top and proceed to the next row by moving diagonally down left

 2. Determine how many paths will spell PERMUTATION if you start

2. Determine how many paths will spell PERMUTATION if you start at the top and proceed to the next row by moving diagonally down left or right. Show all work and provide a therefore statement. - [2 marks] M M T T N N N 3. Show all work, use proper notation and provide a therefore statement. How many 6 letter permutations are there of the letters ABCDEFGHI: a) with exactly 2 vowels and 4 consonants b) where the A and B must be included and A is always in alphabetical order? - [3 marks] before B? For example, ACEDBF is acceptable, but BAECDF is not. - [4 marks]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!