Given the graph below, identify cycles in it that contain Harry.
Note that a cycle cannot contain repeated edges or vertices, besides the starting one (Harry).
![](https://ka-perseus-images.s3.amazonaws.com/faa1c44e1ab848623096b85b9aa32626b8d8d040.png)
[[☃ radio 1]]