LAB TASKS: 1. Implement algorithms A2 in C/C++ 2. Revise implementation of algorithms using functions.

Question Aac  Full explain this question very fast solution sent me step by step

Programing C Just with #include Creating a Tree In this challenge, you will have to use pointers to create a tree. More specifically, the tree shown below: n1 n2 n3 n4 "end" "end" n5 "end" n6 "end" n7 "end" "end" "end" "end" "end" "end" "end" "end" "end" "end" "end" should be the same end we discussed in class for singly linked lists In other words, you will have to create structures that contain one value and three pointers. You will then have to declare your nodes and have their pointers (arrows), point to the nodes specified in the three. You will do this in the exact same way as we did with linked lists. The differences here are that you have more pointers and a different layout of the nodes. Your program should not print anything. It is merely meant to show your understanding of pointers and “nodes" (structures). Therefore, aside from the definitions of your structures, everything should be in main.

def delete task (..., ...): I param: task_collection (list) holds all tasks; param: an integer ID indexes each task (stored as a dictionary) (str) - a string that is supposed to represent an integer ID that indexes the task in the list returns: 0 if the collection is empty. -1 - if the provided parameter is not a string or if it is not a string that contains a valid integer >=0 representing the task's position on the list. Otherwise, returns the item (dict) that was removed from the provided collection. 11 11 11

Draw Stacks (Activation Record Instance) for returns from the belowprogramint recursion(int m, int n, int i, int j){static int sum = 0;if (m == n) {sum += pow(i*j,2);return sum;}else {sum += pow(i*j,2);return recursion(m+1, n, i+1, j+1);}}void main(){printf("sum= %d\n", recursion(1,5,2,3));}