A cost-free graphene with 4-node 8-edge given an adjacency matrix is requested to be kept at the bit-level in order to save memory. Accordingly, define the data structure required to hold the graph with 32 bits. On a graph stored in this way in memory, design a C program called listelegar (G, dugum), which accepts the node information received by it as an input parameter and lists the edges connected to this state.

not c languace