You are competing with your friends to type text messages on your smartphone as quickly as possible. Here are the rules: you use two thumbs for texting and they start out on the bottom left and bottom right keys of the keyboard. To type a character, you move either thumb from its current key to the key you need to press, and it takes time equal to the distance between the keys. You can assume the following: The keyboard has keys labeled {1,2,..., k} and there is a function dist (i,j) to calculate the distance between two keys i and j. (To visualize this, you may want to imagine the digits 1 through 9 arranged on a standard numeric keypad). Your left thumb starts on key a, and your right thumb starts on key b. (For example, on the 9-digit numeric keypad, a = 7 is the bottom left key, and b = 9 is the bottom right key.) You can press any key with either thumb Both thumbs can rest on the same key if necessary The characters to by typed are cC2 Cn, where c; E {1, 2,..., k} is the ith key to push Homework 4 3 Design an algorithm that finds the fastest way to type the message. In other words, your algorithm needs to decide which thumb to use to type each character, and it should minimize the total distance moved by your two thumbs. Try to use O(nk2) time.