This is an exhaustive search algorithm question which the pattern is an exhaustive optimization. However, I need help writing a pseudocode for the given algorithm. Please explain your answer clearly, Thanks.

V. exhaustive search algorithm design Consider the following problem. longest gycle problem input an undirected graph G-(V.E) output a vector C of vertices forming a cycle of maximum length in G that a gri is a path that starts and ends at the same vertex. A puth is a sequence of vertices [vo-v, .. . . ,"m l such that, for any two vertices v,,v,+1 adjacent in C, there exists an edge J. (3 point) Design an algonthm for this problem using the pattern you picked in the previous question. Wite pseudocode for your algorithm below. If you write muliple drafts, cirele your final drat You are welcome to use any of the following combination generation algorithms, without restating their pseudocode or proving their eficiency algorithm number of candidates time complexity range pairs subsets permutationa O(n) O(u2) 0(2" n) 2" n! V. exhaustive search algorithm design Consider the following problem. longest gycle problem input an undirected graph G-(V.E) output a vector C of vertices forming a cycle of maximum length in G that a gri is a path that starts and ends at the same vertex. A puth is a sequence of vertices [vo-v, .. . . ,"m l such that, for any two vertices v,,v,+1 adjacent in C, there exists an edge J. (3 point) Design an algonthm for this problem using the pattern you picked in the previous question. Wite pseudocode for your algorithm below. If you write muliple drafts, cirele your final drat You are welcome to use any of the following combination generation algorithms, without restating their pseudocode or proving their eficiency algorithm number of candidates time complexity range pairs subsets permutationa O(n) O(u2) 0(2" n) 2" n