Write a method that returns an array of values representing a lossy encryption of a string by grouping characters into chunks that are 'group' characters long, adding their ASCII (or UNICODE) values, and then finding the remainder when that sum is divided by 'max'. Store the resulting value in an array that is as long as the number of sets of grouped characters. This is a "lossy" encryption method because it might not be possible to explicitly recover the original message, depending on the values of 'group' and 'max', but it IS possible if certain conditions are met. For example, if 'group' is 1 and 'max' is greater than the greatest ASCII-value in the string, the resulting message can easily be decrypted. However, if 'group' is greater than 2 and/or 'max' is a relatively small number, significant information loss will occur. Look at the test data for examples. As preconditions you may make the following assumptions: 'group'>0, 'max'>2.