Turing Machine to count number of times substring appears in a string?

Question

Given 2 Strings X and Y such that X,Y є {a,b}+ Construct a Turing Machine that outputs the number of times Y appears in X.
Your Turing machine will have 3 tapes. Tape