The time complexity for the Towers of Honoi recursive algorithm in the course note is O(________). code example

Example: tower of hanoi worst case time complexity

O(2^n) [exponential time]