Approximately how many recursive calls would our Towers of Hanoi pseudo code algorithm make given a tower with 11 disks?
There are no hints for this question