I'm not 100% sure if my algorithm here works. Can someone please check if it's right? If you feel that there is a better way to go about this algorithm, I'll definitely take any help! Thanks!

11. [14 marks Given an array A integer values, write storing m integer values and an array B storing n true if A is a in pseudocode an algorithm the value a value sub array of B and it B,m,n) that returns B if there is returns false otherwise. A a sub-array of is 0 such that AIO) BLi m 1. i.e., f the values of A appear in positions BU 1), Alm] and B shown below consecutive of B. For example, for the arrays A algorithm must the algorithm must return the value and B, the return true, but for the arrays A' the value false. A 8 47 A' 1 (m m) return 1 O to n to m A found true if (found) m) returr true else tale. return 12. [3 marks) Compute the worst case time complexity of the above algorithm as a function of m and n and give its order [3 marks] Explain what the worst case of the algorithm is and how you computed the time complexity