Please Don't use chatgpt or other ai tool. I have posted 8 times this question and every time the answer was using AI. I will give you dislike as many as I can. So don't attempt if you are not comfortable. In graph theory, what is the term used to describe a set of edges that forms a closed path in a graph and visits each vertex exactly once? Options: A. Circuit B. Cycle C. Loop D. Trail