you give garland consist n lamp States lamp represent string s length n the ith character string s_i equal 0 ith lamp turn 1 ith lamp turn you give positive integer kIn choose lamp change state ie turn turn vice versaThe garland call kperiodic distance pair adjacent turn lamp exactly k consider case k3 then garland 00010010 1001001 00010 0 good garland 00101001 1000001 01001100 note garland cyclic ie turn lamp going turn lamp vice versaYour task find minimum number move need obtain kperiodic garland give oneYou answer t independent test case