Implement the member function int find_seq_len(int val) of class List, which returns the length of the first sequence made of the given value. Examples. Calling find_seq_len (15) on the following list returns 3: [121515 15 100-15-15-00] Calling find_seq_len (15) on the following list returns 1: [1215 → 1 101015 15 15 0] - B. [6 points] Assuming that the list size is n: • What is the order of growth of the running time of your code in the best case? When does this case occur? What is the order of growth of the running time of your code in the worst case? When does this case occur?