what is the dynamic programming algorithm to count simple cycles in a graph

Question

what is the algorithm to count simple cycles in a graph with time complexity O(n^2*2^n). I know it\'s a dynamic programming approach but I need help building the algorithm.<