Question
answer correctly and clearly please, I will not accept wrong answers!
Consider the following set {a, b, c, d} In how many different orders can this set be arranged? List all the possible arrangements of this set in dictionary order. What is the 15th permutation, that is, the 15th item on the list you created in step b? Write a Pseudocode algorithm for constructing any specified permutation of these four letters, without constructing or referring to the list. Verify that youralgorithm correctly constructs the 15th permutation that you identified in parte. Hint: You may want to start with the example included atthe end of this document, of a Pseudocode lgorithm to identify the kth permutation of a set of 3 objects, and modify it to do 4 objects. Or you may do your own from scratch, if you prefer. This example is not the most efficient version, or the most general, but it does perform correctly in all cases. A fair coin is tossed four times. List the entire sample space for this experiment. Use your sample space from part (a) to answer the following questions: What is the probability that it turns up heads everytime? What is the probability of at least 2 heads? What is the probability of two tails in a row? A single card is drawn from a standard 52-card deck. What is the probability of getting: A 10 or an Ace? An Ace or a diamond?
Explanation / Answer
too much for 750 points...
