<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def diff(s1, s2):
 """ Return a normalised Levenshtein distance between two strings. Distance is normalised by dividing the Levenshtein distance of the two strings by the max(len(s1), len(s2)). Examples: 0 1 1 1 Arguments: s1 (str):
 Argument A. s2 (str):
 Argument B. Returns: float: Normalised distance between the two strings. """

    return levenshtein(s1, s2) / max(len(s1), len(s2))