Answer is E . The catch here is Edges weights belongs to real number . Therefore edge weight can be negative . In that case the minimum spanning tree may be different .
(Here every edge weight is distinct, therefore MST is unique. You do it using any algo.)
Option A is True. If we apply kruskal's algorithm then it will choose $e_1$
Option B is True. If we apply kruskal's algorithm then it will also choose $e_2$, and 2 edges can not forms a cycle. ($e_3$ is not guaranteed in MST, as it may form cycle.)
Option C is also true. If we apply prims also on any vertex (say u) then it chooses minimum
weight edge incident on vertex u.
Option D is true. Because every edge weight is distinct.