1 extra credit points for the minimal correct solution submit your sol
1. (extra credit points for the minimal correct solution. Submit your
solution as a .jff file) The input to TM M is n1$n2, where n1 and n2 are strings of
1's and O's. If either n 1 or n2 starts with a 0, the output is n12n2; if n1 = n2, the
output is n1=n2; when n1 and n2 are interpreted as the binary numbers m1 and m2
respectively, the output is n1<n2 if m1 < m2, and n1>n2 if m1 > m2. A correct
implementation of M will have the transducer results below for the inputs in
test cases.txt, included with the test materials.
The file final.jff, also included with the test materials, encodes a partial
implementation of M. It handles n1 = n2 correctly, as well as some, but not all, of
the cases where m1 < m2, or m1 > m2. It does not handle cases where n1 or n2
starts with a 0.
Enhance final.jff to implement M. To run the test cases in transducer mode, select
Multiple Run (Transducer) from the Input menu, and then select Load Inputs from
the buttons at the bottom of the right panel.
*The amount will be in form of wallet points that you can redeem to pay upto 10% of the price for any assignment. **Use of solution provided by us for unfair practice like cheating will result in action from our end which may include permanent termination of the defaulter’s account.Disclaimer:The website contains certain images which are not owned by the company/ website. Such images are used for indicative purposes only and is a third-party content. All credits go to its rightful owner including its copyright owner. It is also clarified that the use of any photograph on the website including the use of any photograph of any educational institute/ university is not intended to suggest any association, relationship, or sponsorship whatsoever between the company and the said educational institute/ university. Any such use is for representative purposes only and all intellectual property rights belong to the respective owners.