Please work on a piece of paper. Use quick sort to sort the following array {6, 2, 5, 9, 4, 2, 3, 7, 1, 8, 5). Any observations here? Is quick sort stable or not? Is quick sort in-place or not?

Include a formula in the last column on the third row to calculate 75% of the Cost. The formula is =0.75*b3. You do not need to select a number format. Include a formula in the next two rows of the same column, adjusting the row reference as necessary.

Consider the following recurrence: T(1)=1; T(n) = 2.T()+n, for n> 1, n a power of 3. =..... Find T(27) by substitution, starting with n = 1, n = 65 2 169 29 15 6

Python question please include all steps and screenshot of code. Also please provide a docstring, and comments throughout the code, and test the given examples below. Thanks. A single playing card can be represented by a string where the first character is a digit2-9 or a letter ‘A’, ‘T’, ‘J’, ‘Q’, or ‘K’, for Ace, Ten, Jack, Queen, King respectively, andthe second character is one of ‘S’, ‘H’, ‘D’, or ‘C’ for Spades, Hearts, Diamonds, orClubs. A hand of cards can be represented by a list of strings. Write a function calledthreeOfAKind() that takes a list of strings representing a hand of cards, and returns Trueif there are exactly three cards with the same value (regardless of suit), False otherwise.>>> threeOfAKind(['3D', 'KD', 'JD', '3H', '3S'])True>>> threeOfAKind(['3D', 'KD', 'JD', '3H', '4S', '5S'])False>>> threeOfAKind(['3D', '3H', '3S', '3C', 'AC'])False