Search to acanh veluu the nemle callo Q5 We are using Recuroie Binary (increscing liek 1 length 32 fa a The runtime is meaaunel ao to Rec BinSrch ( te aiginal call ui te main program and all recurscie cellb). Assuming that Y the list, compute te avtnge is a) on rutme. the lut with probabilify 707, runtime. tht b) Aosuming Compute th aveige CS Scanned with CamScanner

Code it. Given a non-empty string s and a dictionary wordDictcontaining a list of non-empty words,determine if word can be segmented into a space-separatedsequence of one or more dictionary words.You may assume the dictionary does not contain duplicate words. For example, givenword = "leetcode",dict = ["leet", "code"]. Return true because "leetcode" can be segmented as "leet code". word = abc word_dict = ["a","bc"]True False False False.

I'm trying to delete a node after inputting data for 2-3 checks but the node I try to delete remains in the list. How do I fix my deleteCheck() function to run correctly with the rest of my code? Thank you. #include <stdio.h>#include <stdlib.h>// Austin Chong// The core concept of this assignment is to use a linked list in a C program.// 07 March 2020 struct checkNode{int checkNumber;char date[8];char paidTo[100];char description[100];double amount;struct checkNode *head;struct checkNode *next;}; struct checkNode *checkBook = NULL; /* Functions */ void addCheck(){int checkNumber;double amount;char temp;struct checkNode *newCheck = (struct checkNode*) malloc(sizeof(struct checkNode));printf("Please enter the check number: ");scanf("%d", &checkNumber);newCheck -> checkNumber = checkNumber;printf("Please enter the amount: ");scanf("%lf", &amount);newCheck -> amount = amount;printf("Please enter the date: ");scanf("%c", &temp);scanf("%[^\n]", newCheck ->…

Which of the following implementations of a linked list should be used if the concatenation of two lists is to be performed In O(1) time.A) Doubly linked listB) Circular doubly linked listC) Singly linked listD) Array implementation of lists

Please explain this Python code def trigrams(ls,t): # counts user supplied trigramtrioccurs = 0# loop through longstring counting occurences of targetfor lc in range(0,len(ls)-2):if ls[lc:lc+3] == t:trioccurs += 1return trioccursdef trigrams(ls): # uses a dictionary; finds all trigramsdict = {}# loop through longstring counting occurences of targetfor lc in range(0,len(ls)-2):t = ls[lc:lc+3] # if not there, insert into dictionaryif t not in dict:dict[t] = 1else:dict[t] = dict[t] + 1return dict

It's 2 debug questions (ALL IN PYTHON PROGRAMMING) this function appends n elements to list. The function is required to modify the original list and return None   I don't know whats wrong here: def appendn(lst, n, elem):   for i in range(n):       lst = lst.append(elem)  list1 = ['w', 'o', 'o', 'h']list2 = [] try:    appendn(list1, 3, 'o')   appendn(list2, 10, 0)except:   pass test cases: list1 ['w', 'o', 'o', 'h', 'o', 'o', 'o']     appendn([1, 2, 3], 10, 0) None     list2 [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]       Another question, I suppose to draw a snowflake using this function, but everytime I get to the "whole" part when I put part 1,2,3 together, python tells me that I'm getting Syntax errors. def snowflake():   part1 = kochize(5)   part2 = rotate(2*(pi/3))(kochize(5))   part3 = rotate((-2*(pi/3))(kochize(5))    whole = connect_ends((part1, part2), part3)   return whole I don't understand why am I getting syntax errors with line5 of this function.

Implement the function below void swap(int pos1, int pos2) {} Inital code to be completed: class LinkedList : public List {    node* head;    node* tail;    int index;     node* create_node(int num) {      node* n = (node*) malloc(sizeof(node));        n->element = num;        n->next = NULL;        return n;    }     public:        LinkedList() {          index = 0;          head = NULL;          tail = NULL;        }         int add(int num) {          addTail(num);          return index;        }                int get(int pos) {          node* currnode = head;          int count =0;          while (currnode != NULL){            count++;            if (count == pos){              return currnode -> element;            }else{              currnode = currnode -> next;            }          }          return -1;        }                int size() {            return index;        }                void swap(int pos1, int pos2) {                  }                // WARNING!…

Write a routine bfree (p, n) that will free an arbitrary block pof n characters into the free list maintained by mal10c and free. By usingbfree, a user can add a static or external array to the free list at any time.code in c

In Ocaml Write a function l3_of_3l : ’a list * ’b list * ’c list -> (’a * ’b * ’c) list = that transforms a triple of lists into lists of triples. If lengths don’t match then ignore leftover elements. examples l3_of_3l ([1;2;3] ,[1.;2.] ,[ ’ a ’; ’b ’; ’c ’; ’d ’]) ;;- : ( int * float * char ) list = [(1 , 1. , ’a ’) ; (2 , 2. ,’b ’) ]l3_of_3l ([1.;2.] ,[ ’ a ’; ’b ’; ’c ’; ’d ’] ,[1;2;3]) ;;- : ( float * char * int ) list = [(1. , ’a ’ , 1) ; (2. , ’b’ , 2) ]

This program implements integer addition with arbitrarily large integers.Integers are implemented as doubly linked lists where each link represents onedigit. You are to write the code for the addLongInt function. Other parts ofthe program should not be changed. You should model your solution on thestring adder program that you wrote for mp-0. Your changes will result fromthe fact that the string adder program uses strings to represent arbitrarilylarge integers and this program uses doubly linked lists and here you will bedoing addition base ten.. MUST write the program by supplying the missingcode to the partial program supplied. The only allowed change is that youmay remove using namespace std;, replace cin with std::cin and replacecout with std::cout. Test data:-> 99999999999999999999-> 1 -> 1-> 99999999999999999999 -> 123456789123456789 -> 111111111111111111 -> 88888888888888888888 -> 22222222222222222222 -> 9000000000000000000000009 ->…