18A Hamiltonian path visits:AEvery vertex exactly onceBOnly the start vertex twiceCThe shortest routeDEvery edge exactly onceView AnswerWorkspaceReportSaveEasy