data structure

Questions. (1). Consider the pastyix evaluztion alyexthons. kinte the content of stack fo eneh chrider. of the equstion and the firel resutt of the evalaction. 873-/2l. (9). Mite r fanction thet takes veuk q, copis numbers divisible by 5 to stack si and others to stack S2. Quece 1 is presencet (not changed). protdype of the function is fiven below. voift qtostecks (sumct quese q, sture staik si, (3). Winte a c/CH function thet accepts two linked lists list 1 and list2. Your function Shoud insect a[a] into listz, if a nede of the ust 1 is divisible by 2 , else a [zero]. pletse tssume that the vists alreadf contais elements and lists choald intrilf be empty. Consider the following prototype and the simple wsts (zfer the function relums). void oddEyenL 1 (striat node * List1, struct node List 1 348569 list 2: 011010