In question number 2 on Targil 2 it is written to find a path (Not necessarily simple) that goes through all edges of A.
What does it mean "Not necessarily simple" -
(1) Can I go through some edge more than once ?
(2) Can I go through some vertex more than once ?
Thanks for your help,