In data structures, which of the following is$/$are true for a queue? $($CLO$-1)$a$.$ each node may be linked to only one parent, but several children.b$.$ nodes are added and removed at the same end.c$.$ nodes are added at one end and removed from the otherd. each node may be linked any number of other nodes.