plenity for the Sollowing algprithms in the avergpca Algprithm Selection Son Brute-Force String Maching Brute-Force Closest Pair Brute-Force Polymomial Evaluation Graph Depth First Search (DFS Brute-Force Knapsack problem ex compute the time complexity Sor th r backward sub stitution or recursive tree methods to Hanoi problem? he recurrence for the Tower of Hanoi problem is: Mn)-2Mn-1) 1&M)-L