copilot-gh-300 video for you have a recursive Python function calculate_fibonacci(n) that correctly calculates the Fibonacci sequence but has poor performance
You have a recursive Python function calculate_fibonacci(n) that correctly calculates the Fibonacci sequence but has poor performance for large inputs. You want to use GitHub Copilot to identify performance issues and suggest improvements. def calculate_fibonacci ( n ): if n <= 1 : return n return calculate_fibonacci ( n - 1 ) + calculate_fibonacci ( n - 2 ) How can GitHub Copilot help optimize this function and generate better tests?