The degree-sequence of a Complete Bipartite Graph $K_{p,q}$ is $(p,p,...,p,q,...,q)$ where p is repeated q times and q is repeated p times. Therefore, $K_{2,11}$ would have a degree sequence (2,2,2,2,2,2,2,2,2,2,2,11,11).
Since $K_{2,11}$ is a connected graph with exactly two of its vertices having odd degrees while remaining having even degrees, it will have a Euler path.
Hence options A and C would be right.
Also read,
https://math.stackexchange.com/questions/221512/hamilton-euler-circuit-path