Algorithms in pseudo code **MUST** be placed in code blocks/fences, and use `cpp highlighter. Algorithms should follow the pseudo code standard described in *Pseudocode Handout*. as the syntax - Do NOT change the template except the answer portion. - Formulas and equations should be in math mode using Latex math symbols. Markdown math tutorial: http://tug.ctan.org/info/undergradmath/undergradmat h.pdf Two ways to enter math mode: Insert a pair of dollar signs: \$your equations go here\$. This is the inline math mode. *Notice that there is no space between the \$ and the letter*. Insert a pair of double-dollar signs: \$\$ your equations go here \$\$, which produces a standalone equation/formula set.

def rectangle_overlap(rect1_bl_x,rect1_bl_y,                      rect1_tr_x,rect1_tr_y,                      rect2_bl_x,rect2_bl_y,                      rect2_tr_x,rect2_tr_y):    """    (int,int,int,int,int,int,int,int) -> str        Function determines whether two rectangles overlap. When rectangles    overlap, the function checks for the following scenarios        1. The two rectangles share the same coordinates        2. The first rectangle is contained within the second        3. The second rectangle is contained within the first        4. The rectangles have overlapping area, but neither is completely           contained within the other        Function inputs represent x and y coordinates of bottom left and top right    corners of rectangles (see lab document)               The function return one of the following strings corresponding to the     scenario        "no overlap"        "identical coordinates"        "rectangle 1 is contained within rectangle 2"        "rectangle…

JAVA

#include <stdio.h>   int arrC[10] = {0}; int bSearch(int arr[], int l, int h, int key);   int *joinArray(int arrA[], int arrB[]) {     int j = 0;     if ((arrB[0] + arrB[4]) % 5 == 0)     {         arrB[0] = 0;         arrB[4] = 0;     }       for (int i = 0; i < 5; i++)     {         arrC[j++] = arrA[i];           if (arrB[i] == 0 || (bSearch(arrA, 0, 5, arrB[i]) != -1))         {             continue;         }         else             arrC[j++] = arrB[i];     }       for (int i = 0; i < j; i++)     {         int temp;         for (int k = i + 1; k < j; k++)         {             if (arrC[i] > arrC[k])             {                 temp = arrC[i];                 arrC[i] = arrC[k];                 arrC[k] = temp;             }         }     }     for (int i = 0; i < j; i++)     {         printf("%d ", arrC[i]);     }     return arrC; }   int bSearch(int arr[], int l, int h, int key) {     if (h >= l)     {         int mid = l + (h - l) / 2;           if…

Algorithms in pseudo code **MUST** be placed in code blocks/fences, and use `cpp` as the syntax highlighter. Algorithms should follow the pseudo code standard described in *Pseudocode Handout*. - Do NOT change the template except the answer portion. - Formulas and equations should be in math mode using Latex math symbols. Markdown math tutorial: http://tug.ctan.org/info/undergradmath/undergradmat h.pdf Two ways to enter math mode: Insert a pair of dollar signs: \$your equations go here\$. This is the inline math mode. *Notice that there is no space between the \$ and the letter*. Insert a pair of double-dollar signs: \$\$ your equations go here \$\$, which produces a standalone equation/formula set.

#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode {    struct treeNode* leftPtr;    int data;    struct treeNode* rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode* TreeNodePtr; void insertNode(TreeNodePtr* treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) {    TreeNodePtr rootPtr = NULL;     srand(time(NULL));    puts("The numbers being placed in the tree are:");     for (unsigned int i = 1; i <= 10; ++i) {        int item = rand() % 15;        printf("%3d", item);        insertNode(&rootPtr, item);    }     puts("\n\nThe preOrder traversal is: ");    preOrder(rootPtr);     puts("\n\nThe inOrder traversal is: ");    inOrder(rootPtr);     puts("\n\nThe postOrder traversal is: ");    postOrder(rootPtr);} void insertNode(TreeNodePtr* treePtr, int value) {    if (*treePtr == NULL) {        *treePtr = malloc(sizeof(TreeNode));         if…

Alert dont submit AI generated answer.

#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode {  struct treeNode *leftPtr;  int data;  struct treeNode *rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode *TreeNodePtr; void insertNode(TreeNodePtr *treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) {  TreeNodePtr rootPtr = NULL;   srand(time(NULL));  puts("The numbers being placed in the tree are:");   for (unsigned int i = 1; i <= 10; ++i) {    int item = rand() % 15;    printf("%3d", item);    insertNode(&rootPtr, item);  }   puts("\n\nThe preOrder traversal is: ");  preOrder(rootPtr);   puts("\n\nThe inOrder traversal is: ");  inOrder(rootPtr);   puts("\n\nThe postOrder traversal is: ");  postOrder(rootPtr);} void insertNode(TreeNodePtr *treePtr, int value) {  if (*treePtr == NULL) {    *treePtr = malloc(sizeof(TreeNode));     if (*treePtr != NULL) {      (*treePtr)->data = value;…

Python question Analysis: Invariants (Q16-17) For each of the following functions, identify the loop invariant, exit condition and post condition.    Question 16 (Invariant 1) This function returns the list of integers that are multiples of both 3 and 7 that occurs within a given list. Identify the loop exit condition, the loop post-condition, and the loop invariant at the end of the loop, which shows the algorithm’s correctness. def multiples_count(lst):    """    Input: a list of integers, lst    Output: the list of integers in lst that are multiples of both 3 and 7    """    res = []    for i in range(len(lst)):        if lst[i]%3 == 0 and lst[i]%7 == 0:            res.append(lst[i])        # Identify the loop invariant here    return res Question 17 (Invariant 2) This function checks if a given list (of comparable elements) is sorted in ascending order. Identify the loop exit condition, the loop post-condition, and the loop invariant at the end of each iteration of the loop, which…

Python Big-O Notation/Time Complexity Pls answer only if u know big-o Thanks!  Item #3.