4. (5 marks) If the pattern-matching problem was changed to only find the first instance of a pattern of length m in the text of length n (a) Describe the data that would cause the worst-case performance and the performance in terms of n. Use "Big-O notation, e.g. O(n), O(n2), etc (b) Describe the data that would cause the best-case performance and the performance in terms of n. Use "Big-O, notation, e. g. n), ed n-), etc. 5 (5 marks) Do Exercise 38 from Chapter 3 on page 147 (Exercise 33 from Chapter 3 on