I need help with cybersecurity cipher.

We will add a mangler (sort of an S-box) function to our simple cipher. The mangler (a sort of S-box) will take two bits starting at the left and rotate them horizontally, then mash the left and right halves together.

As follows You have a plaintext character lowercase m: 01101101 You have a key character Uppercase Y: 01011001 Split the key into two subkeys: 0101 1001, and complete two rounds with the subkeys including the mangler functions as illustrated below. Finally, determine what ascii character is represented by the binary code after the second mangler function.

You will perform 2 rounds with the subkeys, and denote the character represented by the ascii binary code.

L1 L2 L3 L4|R1 R2 R3 R4 PlainText Subkey Apply Round Function to Rbits Round Function Result XOR with Lbits Swap halves Mangle bitsL1L2 L3 L4R1 R2 R3 R4 L1L3 R1 R3 L2 L4 R2 R4 Mangler Result becomes input for | L2 L4 R2 R4 L1 L3 R1 R3 next round L1 L2 L3 L4|R1 R2 R3 R4 PlainText Subkey Apply Round Function to Rbits Round Function Result XOR with Lbits Swap halves Mangle bits L1 L2 L3 L4 R1 R2 R3 R4 L1 L3 R1 R3 L2 L4 R2 R4 Mangler L2 L4 R2 R4 L1 L3 R1 R3 L2 L4 R2 R4 L1 L3 R1 R3 = Binary code here ascii character L1 L2 L3 L4|R1 R2 R3 R4 PlainText Subkey Apply Round Function to Rbits Round Function Result XOR with Lbits Swap halves Mangle bitsL1L2 L3 L4R1 R2 R3 R4 L1L3 R1 R3 L2 L4 R2 R4 Mangler Result becomes input for | L2 L4 R2 R4 L1 L3 R1 R3 next round L1 L2 L3 L4|R1 R2 R3 R4 PlainText Subkey Apply Round Function to Rbits Round Function Result XOR with Lbits Swap halves Mangle bits L1 L2 L3 L4 R1 R2 R3 R4 L1 L3 R1 R3 L2 L4 R2 R4 Mangler L2 L4 R2 R4 L1 L3 R1 R3 L2 L4 R2 R4 L1 L3 R1 R3 = Binary code here ascii character