a$\backslash$table$[[\backslash$table$[[$Security$],[$Strength$]],\backslash$table$[[$Symmetric$],[$Key$],[$Algorithms$]],\backslash$table$[[$FFC$],[($DSA$,$ DH$,],[$MQV$)]],\backslash$table$[[$IFC$*],[($RSA$)]],\backslash$table$[[$ECC$*],[($ECDSA$,],[$EdDSA$,$ DH$,],[$MQV$)]]],[80,2$ TDEA,$\backslash$table$[[L=1024.$ Assume that a public key scheme that uses Elliptic Curve Cryptography with an n bit key can be broken in $2^\{$n$/2\}$ steps. What keylength n is needed for this to be the same time as the worst$-$case time to brute force a $128-$bit key? Show the work and explain. Also how does this compare to the table image attached.

b$.$ A rough estimation of the time it takes to factor an n$-$bit number of the type used by RSA is $2^\{8*$n$^\{1/3\}\}(2$ over $8$ times the cube root of n$).$ Given this complexity, what key size n is needed for RSA to be as hard to break as the worst$-$case time to brute force a $128-$bit key? Also how does this compare to the attached table in the image.