Please make sure the answer is a pseudo code. Show explanation if possible.

(2 points) Design an efficient algorithm (pseudo code) that track the k shortest strings (not sorted) seen so far, assuming a string length function that takes unit time. The strings are presented in streaming" fashion and cannot be revisited if not saved. For example, if we want to keep 3 shortest strings (k = 3) from the following input stream: fiu, scis, cop5407, spring, 2022; the output result is fiu, scis, 2022. Analyze the complexity of your algorithm in terms the required number k of shortest strings, and the input stream size n