Explain the dynamic programming approach behind the Needleman-Wunsch algorithm for global sequence alignment. Provide pseudocode or Python code that implements this algorithm with customizable gap penalties and a substitution matrix (e.g., BLOSUM62). Apply the algorithm to align two given protein sequences. Discuss the time and space complexity of your solution and suggest optimizations for space usage if only the alignment score is needed.