write the code for queue enqueue and dequeue function and queue is used array

[] [] partite_sets In the cell below, you are to write a function "partite_sets (graph)" that takes in a BIPARTITE graph as its input, and then returns a single list whose two entries are the partite sets of the graph as lists (the order of the sets outputed does not matter). After compiling the above cell, you should be able to compile the following cell and obtain the desired outputs. print (partite_sets({"A" : ["B", "C"], "B" : partite_sets({"A" : ["B", "C"], "B" : ["A"], "C" : ["A"]}), ["A", "D"], "C" : ["A", "D"], "D" : ["B", "C"]})) This should return [["B","C"], ["A"]] [["A","D"], ["B","C"]] (the order in which the entries appear does not matter) Python Python

4) Recursive Analysis Homework • Unanswered The following algorithm takes an unsorted list of positive integers, along with two integers a and y. It returns the largest number, z, in the list such that either 2* = y or z9 = x is true. It returns 0 if no such z exists. The algorithm assumes that the list size, n, is a power of 2 with n > 1. 1 : integer xyMax(x, y, {a0,a1, ..., an-1}) 2 : if n == 1 3 : if (að у) or (až x) 4 return ao 5 : else 6 : return 0 7 : 8 : # process the left half 9 : 10 : m1 = xyMax(x,y,{a0,..., a4 J-1}) 11 : 12 : # process the right half 13 : m2 = xyMax(x,y,{a ;,.., an-1}) 14 : 15 : 16 : # find the largest 17 : 18 : max %3D тi 19 : if (m2 > max) 20 : 21 : 22 : max %3D тg return max 23 : end xyMax What is the recurrence relation that counts the number of comparisons for this algorithm? (The critical steps are at lines 2, 3, and 19.) What is a good big-O reference function for algorithm xyMax? (Hint: Which Master Theorem applies here?)

struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };