Write down Depth First Search traversal function?

Write a function create_task that creates a dictionary to store the information for a single task. This function takes two parameters: a list with the keys and a list with the corresponding values and returns a dictionary with the provided keys mapping to the corresponding values. In our main program, we will create a list with the keys that allow us to capture: the name of the task (a string) description (a string) due date (a list) priority (an integer) In the main program, create a list called task_fields that stores these keys: task_fields = ["name", "description", "due date", "priority"] Do not hardcode these fields in the function -- they are provided as the argument into the function. Loop over each key to ask the user to input the corresponding information. Assemble it into a new list. Call create_task with these two lists as an input to get the dictionary with the task information. Print the resulting dictionary from the main program. When running the program, you could see…

In the description of bubble sort in the previous question, the sorted section of the list was at the end of the list. In this question, bubble sort will maintain the sorted section of the beginning of the list. Make sure that you are still implementing bubble sort! a) Rewrite the English description of bubble sort from the previous question with the necessary changes so that the sorted elements are at the beginning of the list instead of the end. b) Using your English description of bubble sort, write an outline of the bubble sort algorithm in English. c) Write the bubble_sort_2(L) function. d) Write Nose test cases for bubble_sort_2.  

Write a struct ‘Student’ that has member variables: (string) first name, (int) age and (double) fee. Create a sorted (in ascending order according to the age) linked list of three instances of the struct Student. The age of the students must be 21, 24 and 27. Write a function to insert the new instances (elements of the linked list), and insert three instance whose member variable have age (i) 20, (ii) 23 and (iii) 29. Write a function to remove the instances from the linked list, and remove the instances whose member variables have age (i) 21 and (ii) 29. Write a function to count the elements of the linked list. Write a function to search the elements from the linked list, and implement the function to search an element whose age is 23. Write a function to print the linked list on the console. Consider the Student struct as defined above. Create a stack of 5objects of the class. Implement the following (i) push an element to the stack (ii) pop an element from the stack (iii) get the…