A binary string is an any sequence of 0s and 1s. The length of a binary string is the total number of 0s and 1s in the string. For a nonnegative integer n, let An denote the set of binary strings of length n. For instance, A2 = {00,01,10,11}. We dene a relation R on An as described next. Let a = a1an and b = b1bn be elements in An. Declare aRb For all 1 i n, ai 6= bi implies ai = 0 and bi = 1. Show that R is a partial order on An. Draw the Hasse diagram for A3.

A binary string is an any sequence of Os and 1s. The length of a binary string is the total number of 0s and ls in the string. For a nonnegative integer n, let An denote the set of binary strings of length n. For instance, A2 00,01, 10,11. We define a relation R on A as described next. Let a = ai . . . an and b = bi . . . bn be elements in An. Declare aRb + For all 1 i n, aibi im plies ai 0 and bi = 1. Show that R is a partial order on An Draw the Hasse diagram for As low that H is a partial order on An. Draw the Hasse diagram ior 43