You are given a String text. Concatenate all elements of text to make one string.
You are also given four Strings a, b, c and d, all of which are
substrings of the concatenated text. Find exactly one occurrence of each of these four strings in the
text (they are allowed to overlap). Each character in the text that belongs to one or more of these
substring occurrences is called covered. For example, if the text is "foursubstrings", and
a = "our", b = "s", c = "ring", and d = "sub", one possible configuration is:
foursubstrings - text
our - a
s - b
ring - c
sub - d
++++++ ++++ - covered letters
The letters marked by '+' are covered.
Return a int containing exactly two elements.
The first element should be the minimum possible number of covered
characters in a configuration, and the second element should be
the maximum possible number of covered characters.