Design a C function called kenarVarmi () that tests whether there is an edge between two nodes of a graphene with 4 nodes, the data structure of which is Decoded as follows and kept at the bit level.

struct satir {

unsingned A:1, B:1, C:1, D:1;

};

struct A {

struct satir A[4];

};

It should be in C, Not Another Language and subject : data structures and algorithms