Algorithms Questions and Answers August 10, 2021

a) Define bounding functions and its types b) Discuses Bucket sort algorithm with example Write flow chart for bucket sort Algorithm

Create a bucket sort algorithm: public static int[] BucketSort(int[] array, int numBuckets){ //TODO: implement bucket sort return null;

Use Radix Sort algorithm to sort the array A = [765,984,109,349,653,139,810,451,690,371].

Consider the comparison of LSD Radix sort to Merge and Quick sorts. How does MSD Radix sort compare? While both are O(N) runtime when properly implemented, what tradeoffs do we make with each approach?

3. Radix Sort Perform a radix sort of the following list of numbers, using a radix of 10, into ascending order 329 595 408 15 291 466 7 290 141 53 210 883 107 395 663 Show the binbucket sort conducted in each pass of the radix sort using the provided tables. You must also write down the order of the numbers after each pass. First Pass Order after

Radix Sort Show how the Radix sort algorithm sorts the array: 36 14 27 40 31 17 5. Trace through the algorithm in details. Must show the operation of the algorithm in details.

TIW systemstructnre depicted in Fig. 2 illustrates three cables joined at the smooth junction ring C. Furthermore, a m 35kg cylinder is held by passing through the small. frictionless Determine the tension in cables AC and BC and CD suitable freesbody diagrams and show full workings use 9,51

Suppose you are given the task to sort one thousand 32-bit keys. You have decided to use radix sort for this problem and want to decide how many bits each radix sort digit. Which is best among having 1 bit per radix sort digit, 4 bits per radix sort digit, 8 bits per radix sort digit or 16 bits per radix sort digit? You are provided with a

We want to sort the array 31, 22, 131, 44 using the Radix sort algorithm. After the first iteration of the Radix sort algorithm the content of the array is , , , After the second iteration of the Radix sort algorithm the content of the array is , , , After the third iteration of the Radix sort algorithm the content of the array is , , ,

Suppose you are given the task of sorting n = 1000, 32 bit binary keys. You have decided to use radix sort (which uses counting sort as a stable sorting algorithm subroutine) for this problem but you are unsure whether to use counting sort on each bit separately or whether to use counting sort on groups of bits to minimize the total running time.

part (a) part (b) part (c) part (d) possible values bitsgroups group (d) per group (k) Countingsort time per group Radix sort time i.e., Counting sort time in total (for all groups)

What is the disadvantage of the counting sort algorithm? Can we sort any data type with counting sort algorithm? Explain.

Consider the data 7, 5, 3, 2, 6, 5, 1, 5,2, 7. Apply count sort algorithm to sort the data. Show all steps. Write the time complexity of count sort (Big-O) and Discuss the situation where count sort can be applied successfully.

Use Counting Sort algorithm to sort the array A = [1, 7, 2, 2, 2, 7, 3, 5]. (Note: You shouldperform the Counting Sort algorithm step-by-step and show your work similar to the example inlecture slides). Is the Counting Sort algorithm stable? Why? Use Radix Sort algorithm to sort the array A = [765, 984, 109, 349, 653, 139, 810, 451, 690, 371]

. a) Answer the following questions i. Find the worstcase complexity of counting sort by explaining its working principle. ii. Calculate the memory requirement of counting sort when sorting 32 bits and 64 bits numbers. Explain how radix sort with counters overcomes the memory requirement issues of counting sort by using the idea of prefix sum. b)

Consider this array A, which contains 10 three-digit integers: [365, 943, 345, 461, 154, 761, 145, 171, 855, 243] A is sorted twice with the counting sort algorithm. During the first pass, A is sorted according to each number's last digit, and the resulting array is copied back into A. During the second pass, A is sorted according to each number's

1. Explain the following algorithms for Quick Sort INPUT A1..n an array of integers 1,rintegers satisfying 1

Write the quicksort algorithm. Show asymptotic analysis of quicksort algorithm and compare it with mergesort (use recursion tree).

4) You should sort the given array 25, 18, 190, 70, 16, 17, 18, 103, 86, 40 in ascending order by using Quicksort algorithm which selects the last element of the array as the pivot. Pseudocode for Quicksort is shown below. Show Quicksort steps for the given array elements by writing the values of i and j variables for each step. QUICKSORT (A, p,

Given pseudocode for QUICKSORT and PARTITION, implement the given procedures in the language of your choice and upload the script. QUICKSORT(A, p,r) if p

what circumstance does the Quicksort performance get poor? Briefly explain why the Quicksort slows down so much under this circumstance. And after that, describe a way to make it so that Quicksort does not slow down in that circumstance.

Show how the quicksort algorithm begins to sort the following array of numbers:

44 75 12 43 70 23 85 55 33 Clearly label every function call and every change in the array as shown in the example. For example, quicksort(0,3) partition (0,3) swap 5333 swap 5312 swap 5343 return 2 quicksort (0,1) and quicksort (3,3) Please show the process for quicksort (0,8). 53 33 12 43 33 53 12 43 33 12 53 43 33 12 43 53 Activate Windows Go

convert this quicksort in C code to MIPS version of it. below things are quicksort with c-code and unfinished MIPS quicksort please finish MIPS quicksort #include int data[] = {8,5,14,10,12,3,9,6,1,15,7,4,13,2,11}; int size = 15; //Below functions is for debugging purpose only. Don't implement this /* void debug(){ int i; for(i=0;i printf("%d, ",

Fig. 1 illustrates a pulley, and a lever rod (lever boom) pinsupported at O with a wire at A supporting a mass m as shown. Knowing what you know about rigidbody statics, draw the freebody diagram of the lever OBA,0 B 4 Figure 1 Pulley and lever system.

Explain the below code step by stepspecifying what each line means and does. quicksort :: (Ord a) => [a] -> [a] quicksort [] =[] quicksort (x:xs) = let smallerSorted = quicksort [a | a

For the next question, we look again at priority queues. A priority queue is a queue in which each element has a priority, and where dequeueing always returns the item with the greatest priority in the queue We start by defining a class of priority queue elements (PQelements for short) class PQElement def init(self, v, p) self.val v self.priority

A priority queue is implemented as a binary search tree. The interface is also provided. (a) Write the declarations for the instance variables, inner classes, and so forth, needed for this implementation, using Java. (b) Write the enqueue operation, using this implementation (in Java). (c) Write the dequeue operation, using this implementation (in

Find two use cases (Applications) of the priority queue and explain how the use cases (Applications) apply to the priority queue using Heap. explanation should include the following. * Operations (create, add(), remove(), next(), is_empty) on Priority Queues

2. def split(pq PriorityQueue) split() function accepts a priority queue which keys are integers and which values are strings and splits it to two priority queues based on whether the key is even or odd. Return the result as a tuple. (25 pts) Test case The priority queue is 4, d 8, h 2, b 4, d 8, h 9, i 2, b 7, g 1, a Split it to two priority

Create a program that uses a priority queue to remove the highest value from the elements in the priority queue. The program should be able to: - insert elements into the priority queue - access priority queue elements - remove elements from the priority queue - iterates through a priority queue Insert the following data into your priority queue

Suppose f(n) 2n n and g(n) 2 n represent time growth functions of two algorithms based on the input size, n. Likewise, f(n) 2n 3 and g(n) 2 3n represent space growth functions. a. Determine the asymptotic notations of the worstcase space complexity for f(n) and g(n). b. C. Determine the asymptotic notations of the worstcase time complexity for

Ex Suppose an algorithm has a complexity function T(n) nlog(n) 7n 3n 11 Q Which asymptotic notations does T(n) belong to if g(n) n Q Which asymptotic notations does T(n) belong to if g(n) 0.02n Q Which asymptotic notations does T(n) belong to if g(n) 6n

12.1 Implementation of an alignment algorithm All algorithms take the real array name and the number of elements in the array as factors, and implement them to sort the integers stored in the array in ascending order Selection sorting void sort(intlist, intn) inti, j, min, temp for (i0 i

(a) Explain the Insertion Sort Algorithm for ordering a list L of n objects. Calculate how many comparisons are needed in an insertion sort of the list [23, -4, 8, 1, -20, 5]. (b) Prove that the worst case complexity of Insertion Sort is O (n^2) . Exactly how many comparisons are made, in the worst case, in an insertion sort of n objects? (c) If

Consider the circuit in Fig. q.3 with an input voltage source u(t) and an output current y(t). (a) Write the state and output equations for the system. (b) Find the conditions relating R, R, C, and L that render the system uncontrollable. (c) Find the conditions relating R, R. C. and L that render the system unobservable. (d) Find the transfer

Parallelize the program of finding the sum of n numbers ( a 1 + a 2 +...+ a n ) using different numbers of processes (Algorithm 1: n /2 processors; Algorithm 2: n /log 2 n processors). (1) Draw the diagrams for the implementations of Algorithm 1 and Algorithm 2 respectively. (2) Find the numbers of operations for the implementations of the

Graph Algorithms Algorithm Depth First Search Breadth First Search Dijkstras Algorithm Prims Algorithm Kruskals Algorithm Order of Complexity FloydWarshall algorithm A priority queue backed by a binary heap is assumed to be used

1 How to define the 8queens problem (states, actions, goal test, path cost) 2 Introduce the basic idea of the following search algorithms and analyze the properties of each algorithm. 1. Breadthfirst search algorithm 2. Depthfirst search algorithm 3. Uniformcost search algorithm 4. Depthlimited search algorithm 5. Iterative deepening search

QUESTION1 Compare flowchart and algorithm. Write Algorithm and also draw flowchart to perform following a. Find factorial of a number entered by user. b. Print Fibonacci series up to the number of terms entered by the uses.

1. Describe the difference between inserting and deleting Stack and Queue in the linked list 2. Write the difference between Stack and Queue in the array and the linked list.

Describe the structure and function of both the stack and queue data structure and discuss how they are different from the perspective of how they are used?

The STL stack and queue are considered container adaptors, as they adapt other STL containers to constrain their behavior. What three STL containers can the stack and queue adapt?

1. Write the depthfirst and breadthfirst traversal of this tree and explain how the stack and queue is used in the traversals. (4 mark) Integer Numeric Primitive Data Types in Java Non Numeric char Floating Point boolean byte short int long float double Non Primitive class interface Arrays

3. Briefly describe the difference between Stack and Queue data structures in terms of adding and deleting item. If you use Python list to implement Stack and Queue, what List methods do you use to insert an item and to delete an item You must describe method for Stack and Queue separately.

5. Write a main function to Reverse the elements of queue queueA only using stack and queue operations. Assume all stack and queue methods are provided. The queue must be unchanged. You MUST use ONLY STACK and QUEUE member functions.

1. Compare the pros and cons of different ways of implementation. For example: a.Array-based lists vs. different kinds of Linked list ( time and space consumption?) b.Singly linked lists vs. Doubly linked lists vs. Circular linked lists 2. Identify real world examples where each link implementation is appropriate (singly, doubly, circular)

Create two linked lists. Your task is to swap the data of every second element of the link lists. Once you have done with that print the old link lists as well the new link lists. An illustration is given below Old Link List New Link Lists 5 1 5 1 6 9 9 6 6 15 6 15 7 20 20 7 00 6 8 6,PART B. You need to modify the Part No 1 and the output of link

How to merge two sorted linked lists? Explain? Write an algorithm to merge two sorted linked lists? Input : Head of following linked lists 1->2->3->4->NULL 1->2->5->6->7->8->NULL Output : Linked lists should be merged to, 1->2->3->4->5->6->7->8->NULL

With the aid of a diagram, explain the difference between linked lists and arrays in relation to traversal. With the aid of a diagram, explain the difference between linked lists and arrays in relation to memory efficiency.

the computational properties of divide-and-conquer sorting algorithms, based on tight big-Oh characterizations of the asymptotic growth rate of the functions for the running time or space size, depending on the question. Assume that the input sequence is given as a list, and the output sequence is also a list. Also assume a general implementation

C programming Implement the following function void make DifferenceArray(int srtArr1, int n1, int srtArr2, int n2, int out DifferenceArr, int outN) This function takes two base addresses of arrays of integers srtArr1 and srtArr2, and their respective logical sizes n1 and n2. The elements in each array come in a sorted (strictly ascending) order.

5. The following figure was used in analyzing time efficiency of the improved SelectAlgorithm, which has worstcase linear time performance. The conclusion of this figure is that the number of elements greater than x is at least n6. What is x Why is that at least n6 elements are greater than x 3 3 10 10

Let A, B and C be three sorted arrays each is of n numbers. Design a worstcase linear time algorithm, by writing psuedo code, to decide whether there are i, j, k such that Ai Bj Ck.

Describe a worstcase linear time algorithm that decides if a given sequence of integers (a1, a2,...,an) is a permutation of (1, 2, 3,...,n). Your algorithm only needs to say Yes or No. (Hint counting sort.)

For a general linear process Yt, t 0,1,2, ..., find 1. The expected value of Yt. 2. The variance of Yt. 3. The autocovariance function Yk, for k 0,1,2 of Yt. 4. The autocorrelation function Pk, for k 0,1,2 of Yt. 5. Is the general linear process Yt stationary

a) Our results should show a curved graph for A vs. time and linear and a linear graph for In(A) vs. time. If a certain process/experiment provided data that showed a linear graph for A vs. time and a curved graph for In(A) vs. time, what could you conclude about the kinetics of that process? b) What would you expect to see for a graph of 1/A vs.

Write program in Java

Garden Irrigation System A farmer is planning to build an irrigation system for multiple gardens he owns and he wants to have a main pipeline from east to west (xaxis) which will be carrying water to each gardens small pipeline. He has n gardens of 3 different sizes. Each garden will be directly connected to the main pipeline with smaller

Calculate the change in time of the expected value of linear momentum (Quantum mechanics)

4P (d) p

Linearization Linearize the nonlinear term in the differential equation below about x e using the first two terms of the Taylor series expansion. x 3x lnx f(t), where f(t) 12.873 4e2 (Note e 2.7183) What is the time constant of the linearized system What is the expected steadystate value of the linearized system

Write the pseudocode and provide the time complexities for the following sorting and search algorithms. You are expected to provide a step-by-step explanation of how you arrived at the stated time complexity. (a) Binary search (b) Linear search

a. Is the amount of product B formed linear during the period of time 0 s to 500 s? b. If the dilution of an non allosteric enzyme used is correct, would you expect to see this this behavior in the graph of product B or would you expect a linear graph?

Concentration (M) 1.800 1.600 1.400 1.200 1.000 0.800 0.600 0.400 0.200 0.000 100 Concentration vs Time 200 300 Time (s) Product B Reactant A 400 500 600

1. Can you write the algorithmic form for the above description? example: 2. Show that your algorithm needs at most 3*n/2.

In fact, we can find both the minimum and the maximum using at most 3 n2 comparisons. We do so by maintaining both the minimum and maximum elements seen thus far. Rather than processing each element of the input by comparing it against the current minimum and maximum, at a cost of 2 comparisons per element, 9.2 Selection in expected linear time

Power distribution company is planning a main power line from east to west (xaxis) across its distribution area. The area has n houses The company wants to connect each house directly to the main power line with smaller power lines in northsouth direction (yaxis) Your task is to estimate the optimal position (on the yaxis) of the main power line,

Given an array A of integers, implement a program that finds the ith largest element in the array. For example. A 3, 2, 1, 2, 4, i 2, the element should be 3. If A 3, 2, 1, 2, 4, 4, 9, 8, i3, the output should be 4. In this problem, you are asked to solve the problem without sorting the input array. Your solution should not use any algorithms

Consider an RC circuit with the following characteristics I0.642 A, S6.81 VA, and PF0.423. Sketch the power triangle for this circuit. Determine the values of R and X. A certain 120 Vrms motor is rated at 380 W of power with an efficiency of 78. It has a power factor of 0.8 (lagging). Calculate the following and sketch the power triangle Apparent

Randomized median finding algorithm runs in expected linear time (that is (n), which is c n for some constant c0). Using Markovs inequality compute the probability that the algorithm takes more than 100.c.n log n time for a choice of random pivots (2 points)

Let X, X2, X3 be i.i.d. samples from an exponential distribution with 2, and let Y, Y2, Y3 be order statistics for that sample. (a) Find the marginal distribution for Y (the median of the sample). (b) Find the probability that the median value is less than 1.

1. What is median and how to use it 2. What is mean and how to use it 3. Why are both median and mean important to statistics 4. What is sampling and why is it important to statistics 5. Average and sampling, which one is more important/interesting and why

Randomized median finding algorithm to make your pseudo code generic enough, so that it can answer order statistics for any kth biggest element from an n-element array. For e.g. k For e.g. k= n/2 gives the median and k=1 gives the max.

2. Let W, X, Y, and Z be random variables such that (i) Cov(W, W) Cov(X, X) Cov(Y,Y) Cov(Z, Z) 0.0802 (ii) All other covariances are each equal to 0.0123. Calculate Var(WXYZ). Round your final answer to four decimal places. 3. Consider a random sample of three auto insurance losses (X, X2, X3) drawn from an exponential distribution with mean

Find the final form of the median and range for uniform distribution (0,1) for order statistics?

Median Finding : Implement the following order statistics algorithms : a. Median of groups of 3,5 and 7. b. Randomized median finding algorithm. Make your code generic enough so that it can answer order statistics for any k. For example, k = n/2 gives the median and k=n gives the max. Quick sort : Implement quicksort where the pivot is chosen from

Consider a random sample of size n from a population of continuoustype. Denote the population median as m and the order statistics are Y... Yn. (a) Compute P(Y6

Let X and Y are independent Lomax distributed random variables having a pdf f(x) =(^)/((x+)^(+1) ) ;x>0,>0,>0 a) Find the pdf of Z=X-Y, Z = XY and Z=X/Y by using transformation technique. b) Also find out the median order statistics and joint median order statistics for the Lomax distribute

Consider the circuit in the figure below with V1220 V, V2620 V, Xj2 2, Xc1j 2, and R42. Write the mesh equations for this circuit, expressed as X 11 Y 12 Z X 11 Y 12 Z In the above equations, the coefficients X, X, etc. are real or complex numbers. Note that you do not have to solve the equations. V1 XL R13 VI va PROBLEM 2. Consider the circuit

1. Write bubblesort(a) function to execute bubble sort algorithm, which is a simple sorting algorithm that repeatedly steps through a list, compares adjacent elements and swaps them if they are in the wrong order, until the list is sorted. The algorithm, which is a comparison sort, is named for the way smaller or larger elements bubble to the top

Java- For some reason my loops are ignoring my println statements and I'm not sure why its skipping over them. Also the three different arrays (10,100,1000) aren't being processed through the For loop. I need the output to look similar to this: size 10 --unsorted-- shell sort ...etc bubble sort...etc bubble sort 2...etc --sorted-- shell sort

X public static void main(String args) long start, end, execution int size10, 100, 1000) for (int i0 i

Define Selection Sort and Bubble Sort algorithms. How would you sort the following array using selection and bubble sort algorithms. What is the time complexity of each algorithms? a=[4, 2, 6, 5, 9]

This is a computer science II Java coding question- please read the instructions and use the pre-written code below to complete the program and get the correct output.

Using a Bubble Sort in Java m E Using a Bubble Sort Summary In this lab, you complete a Java program that uses an array to store data for the village of Marengo. The program is described in Chapter 8, Exercise 5, in Programming Logic and Design. The program should allow the user to enter each household size and determine the mean and median

1. Create an unsorted set of nine different integers and apply bubble sort and insertion sort. a) Apply bubble sort (show all steps) b) Apply insertion sort (show all steps)

Prompt the user to enter 3 scores and the users name Send the scores to a Function & create a Bubble Sort Sort the #s from largest to smallest Send the name to a Bubble sort and sort the letters Part 2= Modify the bubble sort to run faster and explain why using c++ code

a) Write code (or pseudocode) of the bubble sort algorithm and analyze the computational complexity of it Using the code you wrote, calculate the best, worst and average complexity of bubble sort algorithm step by step Show the steps of your solution. b)Sort the following list in alphabetical order using bubble sort algorithm Show all the steps of

Bubble Sort Implementation Instructions: - Implement the bubble sort algorithm in Java. - The program should take an array of integers as input and sort it using the bubble sort technique. - Write a function to perform the bubble sort operation on the given array. - Display the original array before sorting and the sorted array after sorting. -

The list of numbers is to be sorted in descending order. Use the bubble sort to obtain the sorted list. Giving the state of the list after complete the pass. 35 26 45 19 74 56 44 What is the best case time complexity of bubble sort? What is the advantage of bubble sort over other sorting techniques? Why bubble sort is called bubble sort? Is bubble

Q2. Figure 2 below represents a binary search tree. Draw a new binary search tree after the node A is deleted using the binary search tree deletion that is covered in the class Note The character represents a name of node, not a key value of the node. B H M Figure 2. Binary search tree

Following is a binary search tree that was built based on its key values. But the key values are hidden in the figure and only labels (A,B,C, ) are shown. (a) Suppose that the values are actually ten integer numbers 1, 3, 5, 8, 11, 13, 20, 24, 24, 29. Draw the binary search tree again with the numbers in the right place to keep binary search tree

H B E F

Binary Search Tree and Tree Traversal Draw a binary search tree that results in the following postorder traversal 1, 4, 3, 5, 2

Data Structures (Python)

Considering a Binary Search Tree with nodes a to g Integers a b d e f 12 32 31 24 12 31 34 a) What is the BEST structure of your binary search tree for searching Please draw it out. b) What is the WORST structure of your binary search tree for searching Please draw it out. c) What is the best order of your input so as to build the Binary Search

A binary search tree has the following traversals Inorder 13, 23, 31, 49, 50, 54, 55, 56, 57, 58, 70, 80, 83, 99, 100 Postorder 13, 31, 23, 50, 55, 54, 49, 57, 70, 58, 83, 100, 99, 80, 56 Draw the binary search tree using this information. What type of binary search tree can this be called

Write in the Scheme programming language

A binary search tree is a binary tree for which the value in each node is greater than or equal to all values in its left subtree, and less than all values in its right subtree. The binary tree given as example in problem 2 also qualifies as a binary search tree. Using the same list representation, write a recursive function (insertbst V T), which

Use the following binary search tree to answer the following questions Albert Jack Bob Molly Morley Rob Sam William Spiff Zorro

Create a Binary Search Tree by starting with an empty tree and inserting the following keys one by one in order: 30, 18, 50, 5, 24, 36

Given the Binary Search Tree in Fig. 1 1 2 5 1 10 1 1 1 1 15 1 1 12 1 20 Fig. 1 Answer the following questions (3 point each) a. What tree do you get if you insert 7 into the binary search tree in Fig. 1 b. What tree do you get if you remove 5 from the binary search tree in Fig. 1 c. What tree do you get if you remove 15 from the binary search

The 30 kg pendulum has its mass center at G and a radius of gyration about point G of kg 300 mm. If it is released from rest when 0, determine its angular velocity at the instant 0 90. Spring AB has a stiffness of k 300 Nm and is unstretched when 0 0. 0.35 m 0.1 m G 0.6 m ww B 300 Nm

(i). 4 marks Given a binary search tree T3 as shown in Fig. 3, show the nodes examined when searching for 45. (ii). 7 marks Given a binary search tree T3 as shown in Fig. 3, draw the binary search tree after inserting 26, 42 in order. (iii). 7 marks Given a binary search tree T, as shown in Fig. 3, draw the binary search tree after deleting 36,

c languege 9.1 - struct node {int key; double value; *lchild; *rchild;} - Implement the modified_search() algorithm - The modified_search is searched using the key - a functional circle : treePointer modified_search(treePointer tree, int key) - The main function generates 12 (key, value) pairs and adds them to the binary search tree - Output (key,

Write the running time in BigOh notation for each of the following algorithms (each 2 marks, 10 marks total) a) Delete, binary search tree (worstcase). b) Insert, binary search tree (average case). c) Search, complete binary search tree (worse case) d) delete, binary tree (worse case) e) traversal, binary search tree (worse case) Paragraph b) BI UA

Using the binary search tree algorithms discussed in class and alphabetical order A. Draw the binary search tree that would result from inserting the following sequence of items into an initially empty binary search tree Matt, Zeke, Pete, Lon, John, Mei, Larry, Bess, Merv, Adam, Kate B. Draw the binary search tree resulting from removing Pete from

17. In the rooted tree T ( with root a) show in the figure below, (T) mn 9h (a) Find The order dose a preorder traversal visit the vertices in the ordered rooted tree T Pq (b) Find The order dose a inorder traversal visit the vertices in the ordered rooted tree T (c) Find The order dose a postorder traversal visit the vertices in the ordered

An isomorphism from the rooted tree Ti to the rooted tree T2 is an isomorphism of graphs from Ti to T2 that sends the root of Ti to the root of T. (1) Give an example of two rooted trees that are not isomorphic, but are isomorphic as graphs. (2) Prove that the height of a rooted tree is an invariant under isomorphism of rooted trees.

The postorder traversal of the rooted tree displayed below produce a C de 8 QUESTION 5 The preorder traversal of the rooted tree displayed below produce T a,Let GVT.SP) be the phrase structure grammar with V0.1.A.B.5) T(0.1), and set of productions P consisting of SDA 514 A06, B1A B1 What is the language generated by G TTT Anal 3(12) . TEE.80 31