package eecs.hm; public class M2 { /*  Given a non-empty string,determine the longest sequence of repeating characters  in it (i.e. consecutive characters that are the same) and return the repeating  character and its repetition count delimited by an equal sign. If more than one  such sequence is found, the return should be about the one that occurs first in  the string.   Example: longest("ZZZZAISSDRRIIIIIIIHHHQQQDDDDDDDZZZZZDD") returns "I=7" because  there are two longest repeating sequences in this string (D and I, each repeating  7 times) and the I sequence occurs before the D sequence.   */  public static String longest(String s) { return null; // delete me!  } }