Alice and Bob have the following RSA parameters:

$n_A=171024704183616109700818066925197841516671277,$

$n_B=839073542734369359260871355939062622747633109,$

$e_A=1571,e_B=87697.$

Bob knows that

$p_B=98763457697834568934613,q_B=8495789457893457345793$

$($where $n_B=p_B{q}_B).$ Alice signs a document and sends the document and signature $(m,s)($where $s-=m^{d_A}(mod{n}_A))$ to Bob. To keep the contents of the document secret, she encrypts using Bob's public key. Bob receives the encrypted signature pair $(m_1,s_1)-=(m^{e_B},s^{e_B})(mod{n}_B),$ where

$m_1=418726553997094258577980055061305150940547956$

$s_1=749142649641548101520133634736865752883277237.$

Find the message $m$ and verify that it came from Alice. $($The numbers $m_1,s_1,n_A,n_B,p_B,q_B$ are stored as sigpairm$1,$ sigpairs$1,$ signa, signb, sigpb, sigqb in the downloadable computer files $($ bit. $1$y$/2$JbcS$6$p$).)$Using MATLAB