as know maximum clique problem arbitrary graph NPhard Nevertheless graph specific kind solve effectivelyjust case let remind clique nondirected graph subset vertex graph vertex subset connect edge in particular set vertex set consist single vertex cliqueslet define divisibility graph set positive integer Aa1a2an follow the vertex give graph number set a number ai aj ij connected edge ai divisible aj aj divisible aiYou given set nonnegative integer a Determine size maximum clique divisibility graph set a