Let S be the set of all strings of 0’s and 1’s, and define D: S → Z as follows: For all s ∈ S,

D ( s ) = the number of 1’s in s minus the number of 0’s in s.

a. Is D one-to-one? Prove or give a counterexample.

b. Is D onto? Prove or give a counterexample.

International Business: Chapter 3 ● The legal environment ○ Differences in legal systems ■ Rule of law ■ Role of lawyers ■ Burden of proof ■ Right to judicial review ■ laws ○ Bases of different...