(d) A data pattern analyser is to be built that can detect and count up the number of occurrences of two and three letter sub sequences in a sequence (e.g. (x,y) or (c,a,t) ). The analyser should stop if it encounters * in the sequence and return the number of occurrences found up to that point. So, for example, consider that we are searching for: The two letter sequence (a,b) The three letter sequence (b,a,d) Input string (a,b,a,b,b,a,b,*) (a,b,a,d,a,b) (b,a,b,a,d, *) (*,a,b) (a,b,a,d,*, a,b,a,d) 2 letter sub sequences found 3 2 1 0 1 3 letter sub sequences found 0 1 1 0 1 3 Produce a formal statement of this problem, and then write an algorithm to solve the problem using a pseudo code style similar to the one shown in parts (a) to (C). State the bounds on the best and worst case performance of your algorithms using O, 12 and e appropriately to receive full marks