Indistinguishability attack example
To prove that a scheme is not secure under such a definition you usually would propose an algorithm such that the experiment described in your question outputs $1$ with probability non-negligibly larger than $1/2$.
As this looks very much like a homework problem I will not give you a solution. However constructing the algorithm is actually very simple in this case. You only need to think about how you would choose the messages $m^{(0)},m^{(1)}$ in such a way that you would be able to distinguish their ciphertexts.
As a hint: The deterministic nature of the encryption-process could be a problem here, and you can actually distinguish with probability $1$.