C-2.7 Using the Sequence ADT, describe an efficient way of putting a sequence rep- resenting a deck of n cards into random order. Use the function randomlnt(n), which returns a random number between 0 andn- 1, inclusive. Your method should guarantee that every possible ordering is equally likely. What is the run- ning time of your method, if the sequence is implemented with an array? What if it is implemented with a linked list