you give integer array num we subset num good product represent product distinct prime numbersfor example num 1 2 3 42 3 1 2 3 1 3 good subset product 6 23 6 23 3 3 respectively1 4 4 good subset product 4 22 4 22 respectivelyreturn number different good subset num modulo 109 7A subset num array obtain delete possibly element num two subset different choose index delete different Example 1input num 1234output 6explanation the good subset 12 product 2 product distinct prime 2 123 product 6 product distinct prime 2 3 13 product 3 product distinct prime 3 2 product 2 product distinct prime 2 23 product 6 product distinct prime 2 3 3 product 3 product distinct prime 3example 2input num 42315output 5explanation the good subset 2 product 2 product distinct prime 2 23 product 6 product distinct prime 2 3 215 product 30 product distinct prime 2 3 5 3 product 3 product distinct prime 3 15 product 15 product distinct prime 3 5 constraints1 numslength 1051 numsi 30