(1) (10 pts) Given two strings s and t, write a function to determine ift is an anagram of s in at worst case O(n log n) (4) (10 pts) Give the topological sort of the following graph starting at s. (5)
OR
OR
(1) (10 pts) Given two strings s and t, write a function to determine ift is an anagram of s in at worst case O(n log n) (4) (10 pts) Give the topological sort of the following graph starting at s. (5)