Consider the following prefix code: 0, 10, 110, 111) Verify that 2-4-1 in this case (show vour calculations) and draw a binary tree with labeled edges corresponding to this code. . In the class, we proved the Kraft-McMillar inequality: Provide an example of a prefix code where the sum is strictly less than 1, and draw its corresponding binary tree ling binary tree. Consider the following prefix code: 0, 10, 110, 111) Verify that 2-4-1 in this case (show vour calculations) and draw a binary tree with labeled edges corresponding to this code. . In the class, we proved the Kraft-McMillar inequality: Provide an example of a prefix code where the sum is strictly less than 1, and draw its corresponding binary tree ling binary tree