In this question, you must sort the steps of a handshake that closely resembles the TLS$1\mathrm{.}2$ handshake protocol into the correct order.

The protocol includes the steps taken by the client to $($VERIFY SERVER'S PUBLIC KEY CERTIFICATE$)$ and the earliest point at which the $($CLIENT AUTHENTICATES SERVER$).$ These must be included at the correct point $($i$.$e$.,$ the earliest position when the client can carry this out$)$ in the TLS handshake

Some parts of the protocol have been removed with the text XXX

Note that rc and rs are randomly generated numbers by the client and server, respectively.

DHE indicates the method of establishing the shared key, which here is "Elliptic Curve Diffie$-$Hellman Ephemeral." The "ephemeral" just indicates that the secret Diffie Hellman values should be chosen freshly.

RSA is the digital signature scheme

AES$256$ is the symmetric key encryption algorithm to be used, and its keylength

CBC is the mode of operation of the symmetric key encryption

SHA$256$ is the hashing algorithm

Options:

A$.$ XXX$,$ rc ECDHE$-$RSA$-$AES$256-$CBC$-$SHA$256$

B$.$ CLIENT AUTHENTICATES SERVER

C$.$ Client$-$To$-$Server MAC$[$handshake$.$log$.$so$.$far$]$

D$.$ XXX$,$ rs$,$ Certs, ys$,$ sigs$($ys$),$XXX

E$.$ yc

F$.$ Server$-$To$-$Client MAC$[$handshake$.$log$.$so$.$far$]$

G$.$CLIENT VERIFY SERVER's PUBLIC KEY CERTIFICATE