Reverse A Word With A Stack

The Stack class is given. Write reverse_word(text: str) -> str that pushes every character of text onto a stack, then pops until the stack is empty, adding each popped character to a result string, so the word comes back reversed; a stack is last in, first out. Use the stack's push(), pop() and is_empty() methods. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: one line, the word; the tests print the string your function returns.