Answer:
possibly he made an image in the photo or this
Explanation:
The sole proprietorship it is the simplist business form under which one can operate a business. the answer is one.
The answer is A! Hope this is helpful!
Answer:
B.O(2n)
Explanation:
The time complexity of solving towers of hanoi problem recursively is O(2n) because there are two recursion calls in the solution of tower of hanoi.First recursive call to move n-1 disks to from source to helper then the user moves nth disk from source to destination after that recursion moves n-1 disks from helper to destination using source as helper rod.So each recursive call make two more recursive call this makes the time complexity be O(2n).
