[A toy example for the subset sum problem] Consider the definition of the modular subset sum problem. Let q = 17, a = ( 2, 14, 7, 4, 10, 12 ), and s = (1 1 0 0 0 1). Compute t = fa(s). (Note that t { 0, 1, , 16}.)