Let 𝒈 be a threshold gate and 𝑮𝒈 be a graph succinctly represented by 𝒈.Prove either 𝑘-cycle problem on 𝑮𝒈 is in 𝖯 or it is 𝖭𝖯-hard.
