computer science logic only need question 2

Problem 1 How many substrings aab are in www, where w = aabbab ? Problem 2 The reverse of a string can be defined by the recursive rules: aR = a (wa) = awR for all a 8, w * Prove that for all u,v et (uv) R = RUR