Deterministic CSL = semi Deterministic CSL

How Can it be proven that a
deterministic CSL = semi-deterministic CSL ?
Does that imply that a CSL = semi CSL?
Would I need to build a Turing machine since a language accepted by a Turing machine is considered semi CSL