Explain in detail why the Stack data structure is the perfect choice for validating correctly matched parentheses, brackets, and braces in a source code file. Focus on the Last-In, First-Out (LIFO) principle and how it directly maps to the nesting nature of brackets. Provide concrete examples of why other data structures (like queues or arrays without explicit stack operations) would be less efficient or suitable.

Provide a step-by-step algorithmic walkthrough using the example input string "{[()]}". For each character in the string, clearly describe: the current character being processed, the action taken by the algorithm (e.g., push an opening bracket, pop a matching closing bracket, identify an unmatched bracket, etc.), and the state of the stack after the action. Explain how the algorithm determines if the string is valid or invalid based on the final state of the stack and any encountered mismatches.

Summarize the time complexity and space complexity of the bracket validation algorithm using a stack.