Part I: String Compressor (20 points) In this problem, you will be implementing a basic data compression algorithm Write a function compress.line ), which takes one argument, line, a string that you will need to compress it The algorithm works like this: take a string and start reading from the beginning, compress identical consecutive characters in the form of count of that character directly followed by that character. In the end, the original string will be shortened (hopefully!), and the function should return that shortened result For example, the string 'AAABBBCCC' will be shortened to '3A3B3C'; the string 'AAC!!?????' will be CSE 101 - Spring 2018 Lab #1 ! Page l G@@B ' will be shortened to'3 4G1B2 '. Notice thata space shortened to 2A1C2!5?; and the string' is also considered a character Note: You may assume that only valid strings will be given as an input for the function. Also, it is very important that you do a .strip n' on every string. This is because the invisible newline/return characters may cause issues when you do Part II of this assignment Examples: Function Call compress.line(PPPPPPPPggggggggggffff+++n compress.line(' PwwwwwwRRRRRRr') compress.line (' hhhhhhhhhhcccCcccFFFFFFFFFvvvvdddd Return Value 2 8P10g4f3+1n5 1M 3 1P6w6R 3 10h7c9F4v4d8 9t compress.line mmmmmmmm 3 8m7 4?1 10-2 1U4w3 4