Let N be a positive integer. Consider the following algorithm: input: N for i elementof {1, 2, ..., N} do a_i = 1 end for n elementof {2, ..., N} do for i elementof {n, ..., N} do if n | i then a_i: 1 -a_i; end end end output: a_1, ..., a_N Describe the output of this algorithm. Justify your