2. We know a subset can be represented by an array of 1's and O's (1 for an item in the subset and 0 for an item not in the subset). Shown below are some example subsets of {A, B, C, D, E} and their amay-representation. Note that #(l's in the array) equals the size of the subset. Subsets ABCD EArray representation A, B, E 0 0 [1.0. 0, 1] 0 0 0 0[0, 1,0, 0, 0] 0 0 0 00 [0, 0, 0, 0,0 0 What does the following code return when subsetOne and subsetTwo equal the arrays for subsets (A, B, E and B)? for i-0; i++) (int if (subsetone [i]!-subsetTwo[i]) return (false)