Time complexity of the travelling salesman problem (recursive)

Question

According to this recursion formula for dynamic programming (Held–Karp algorithm), the minimum cost can be found. I entered this code in C ++ and this was achieved (ne