d) A data pattern analyser is to be built that can detect and count up the number of occurrences of strictly increasing and strictly decreasing sequences of three numbers in an input sequence. So for the sequence (1,2,3,4) there are two strictly increasing sequences (1,2,3) and (2,3,4). The analyser should stop if it encounters 0 in the input sequence and return the number of occurrences found up to that point in the form of a 2-tuple (\#increasing, \#decreasing). So, for example: 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, and appropriately