the question I need help in explaining is this -
Outline how the Graph Isomorphism Problem can be used to construct a zero-knowledge proof.
and
Justification for why your scenario meets the requirements for being a zero knowledge proof.
I do not understand how this works. if someone could lead me in the correct direction that would be nice.