You're decorating a room with balloons for your friend's birthday party. There are balloons of K different colors, and you have access to infinite amount of balloons of any color. You want to arrange N balloons in a row, with the only condition that no two adjacent balloons can be of the same color, because your friend will dislike it. How many ways are there to arrange the balloons? Since the answer can be very large, print it modulo 1019+7. Function Description Complete the countWays function in the editor below. It has the following parameter(s): Name Description the number of balloons you want to n INTEGER Parameters arrange k INTEGER the number of possible balloon colors The function must return an INTEGER denoting the the number of ways to arrange the balloons according to the rule Return Constraints 1sns 10^5 1sks 10^5 Input Format For Custom Testing The first line contains an integer, n, denoting the number of balloons you want to arrange. The next line contains an integer, k, denoting the number of possible balloon colors. Sample Cases Input Output Output Description There are 2 balloons to arrange and 3 possible colors to choose from. 2 All options are [1, 1], [1, 2], [1, 3], [2, 1], [2, 2], [2, 3], [3, 1], [3, 2], [3, 3]. However [1, 1], [2, 2] and [3, 3] break the rule, so the answer is 9- 3 6=3. 1 There is only one ballon and it can have any of the 8 colors, thus the answer is 8. 8. 8 There are 3 balloons and only 1 possible color. Only one arrangement is possible: [1, 1, 1] but it obviously breaks the rule. Thus the answer is 0. 3 1 If Possible do it in Python language.