Bit Lightyear andfinity beyondafter graduate computer science Vlad award array a_1a_2ldotsa_n n nonnegative integer as natural want construct graph consist n vertex number 1 2ldots n he decide add edge j a_i a_j 0 denote bitwise and operationvlad want graph connect case initially in order satisfy follow type operation array choose element a_i increment 1 Choose element a_i decrement 1 possible a_i 0 it prove exist finite sequence operation graph connect so help Vlad find minimum possible number operation provide way