Write a function that, given a sequence as an argument, allows to detect if there are repeated sub-sequences of size k (the second argument of the function). The result should be a dictionary where keys are sub-sequences and values are the number of times they occur (at least 2). The function template is given to you as below. (Hints: you can make use of the function "search_all_occurrences" shown to you in Lecture 6)

Brief (no more than three lines) observations on the following matters should be included: (what/why/advantage(s)/disadvantage(s)) The Mancunian Way

Abstract of one scientific study on artificial intelligence in education with reference Up to 500 words, without plagiarism

A pistol-wielding robber approached a Quaker on a rural road. "Your money or your life!" shouted the thief. "Exchange is allowed, and I will offer thee my purse for the weapon," my buddy said. The thief accepted the handbag, then the quaker held the pistol to his head and said, "Now friend, give me back my pocketbook or the weapon may go off fire," according to the robber.