Hello folks, going over a few past papers for revision here and was just wondering if anyone would know the answer to this question:
a) is easy enough to understand, you follow the paths using up the numbers in the bit pattern. But for the second one I just can't seem to begin piecing it together in my head.
I could create another tree with all those letters (a.w.o.d.c.u.t.e.r) in it but I assume they want the smallest string of numbers possible?
Appreciate any help. Thanks.

a) is easy enough to understand, you follow the paths using up the numbers in the bit pattern. But for the second one I just can't seem to begin piecing it together in my head.
I could create another tree with all those letters (a.w.o.d.c.u.t.e.r) in it but I assume they want the smallest string of numbers possible?
Appreciate any help. Thanks.
