$4.$ Digital Signatures to Identification Schemes $[25$ Marks$].$

Describe how to construct an Identification scheme $\backslash (\backslash$Pi$^\{\backslash$prime$\}\backslash )$ from any Digital Signature Scheme $\backslash (\backslash$Pi $\backslash ).$ Given that $\backslash (\backslash$Pi $\backslash )$ is secure $($existentially unforgeable under an adaptive chosen$-$message attack$),$ sketch an informal proof of the security of $\backslash (\backslash$Pi$^\{\backslash$prime$\}\backslash ).$