In Python 3 please

Write a function, longest Sorted(s), that takes a string s, and returns the longest substring of s that is sorted in increasing order (A to Z sorting). Note: assuming the strings contains all lowercase letters, and no spaces. If two sorted substrings have the same length, the first one should be returned.

For example: Test Result print(longest_Sorted ("abxcedebdefazkltu")) bdef print(longest_Sorted("dmobgaka")) dimo print(longest Sorted ("yxoned"))