1.2 Recursive Encoding [15 marks] Question Write the recursive function encoding_R(word) to encode the given word (str) from English to numeric string (str). You may assume that the word will only consists of uppercase characters. Restrictions . You may not use iterative constructs (e.g., loop, list comprehensions, etc.) to solve this. . The function encoding_R must be recursive (i.e., it calls itself). The use of any recursive helper functions will not be counted as being recursive. continue on the next page... 2 Assumptions . word is in uppercase. Note . The output is a string (str) instead of an integer (int). As such, the leading zeroes are printed