undefined

Write the body of a function max_level_height(s) that consumes a string s consisting of only 'u' and 'd' characters and returns the highest point assuming you started at level 0 and moved up one level for each 'u' and down one level for each 'd' in the order these characters appear in s. Do not use either recursion or abstract list functions. Hint: Students tend to misread this problem. Make sure you're reading what the function is supposed to do and write some reasonable tests that go beyond what we provide in examples! 0/3 points Attempts: 0 / Unlimited 1- def max_level_height(s): 2 Returns the maximum level starting from zero and going up for each 'u' 4. character in s and down for every 'd' character in the order these 5 characters appear in s. max_level_height: Str -> Nat Requires: s consists of only 'u' and 'd' characters. 8 9 10 11 12 13 14 15 16 17 Examples: max_level_height("") => 0 max_level_height("uuuduu") => 4 max_level_height("ddddud") => 0 ##YOUR CODE GOES HERE pass