The shortest-cycle problem is the problem of determining a simple cycle (no repeated vertices) of minimum length in a graph with m edges and n vertices.

Determine

a) if this problem NP-Hard, or

(b) Identify the smallest values k and l such that there is an O(m^k n^l poly(log(m), log(n))) algorithm for this problem.)

A normal algorithm pseudocode is enough