The followingcited is an restoration amount in binary notation. Each message represents a uncommon binary digit which message represents 1 and represents 0? Design an algorithm ce solving amounts love this.
Y X X
+ X Y X
so suffer us conjecture that every the appraises of x=1 and every of appraises of y are enthralled to be 0 (y=0)
So suffer us set-down these appraise in the above-abandoned equation, we earn
Y X X = 0 1 1
X Y X = 1 0 1
so following we gather couple abandoned binary appraises we earn 1 0 0 0
and if we descry the appraise of X Y Y Y = 1 0 0 0.
So future proved.