z belongs to L iff number of 0's in z is divisible by k, k ≥ 2 and number of 1's in z is odd.
For simplicity let K = 4.
Now, we need to draw the minimal dfa such that no. of 0's is divisible by 4 and no. of 1's is odd.
Now if you try to draw for k, then you will have k state in the first row.
To match odd no. of 1's you will have k state in the second row.
Total no. of states is 2k.