Write and test a recursive Python function `lc_leading_substring`, that returns the longest common leading substring of two strings, `left` and `right`. This means comparing the two strings starting from their first character. The function should return the empty string if there is no match. This function should be useful when you move on to coding.
