S
  1. study help
  2. subject categories
  3. computer science
  4. algorithms
  5. august 2018
  6. 06

Algorithms Questions and Answers August 06, 2018

Expert-verified solutions to help you succeed

Q:Question:design of anal of algorithm 7.1-4 How would you modify QUICKSORT to sort into nonincreasing order? 7.2-2 What is the running time of QUiCKsorT when all elements of array A have the same value? 7.2-3 Show that the running time of QUICKSORT is ?(n^2) when the array A contains distinct elements and is sorted in decreasing

Q:Question:8. 4-2 Explain why the worst-case running time for bucket sort is ??.n2/. What simple change to the algorithm preserves its linear average-case running time and makes its worst-case running time O.n lg n/?A:Answer:The worst case for bucket sort occurs when the all...

Q:Question:Draw the rooted tree with root a and c. (Please show detailed work) 9. ( 6 points) Draw the rooted tree with root \( a \) and \( c \).

Q:Question:Let T = (V, E) be a tree, and let r, r? ? V be any two nodes. Prove that the height of the rooted tree (T, r) is at most twice the height of the rooted tree (T, r?). Please use the knowledge of graph theory to proof and do not copy the answer from others.A:Answer:See a step by step answer

Q:Question:Is the rooted tree in Exercise 4 a full \( m \)-ary tree for some positive integer \( m \) ?What is the level of each vertex of the rooted tree in Exercise 4?

Q:Question:following Binary search tree will look like after adding value 27 to the tree, and then deleting the node with value 65 , using the predecessor approach. Original Binary search tree Resulting Binary search tree b. Show how the following Binary search tree will look like after adding value 82 to the tree, and then deleting the node with

Q:Question:Suppose we are comparing implementation of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in 64n log2 n steps. For which values of n does insertion sort beat merge sort?A:Answer:See a step by step answer

Q:Question:c++ Swap two adjacent elements by adjusting only the links (and not the data) using a. singly linked lists b. doubly linked listsA:Answer:a. Swapping Adjacent elements in a Singly linked l...

Q:Question:the following order rooted tree for questions #11, #12, and #13 (5 points each) Question #11 (5 Points) Using the provided order rooted tree above, determine the order in which a pre-order traversal visits the vertices. Question #12 (5 Points) Using the provided order rooted tree above, determine the order in which an in-order traversal

Q:Question:Q5. (Section 8.4) Explain why the worst-case running time for bucket sort is ?(n2). What simple change to the algorithm preserves its linear average-case running time and makes its worst-case running time ?(nlgn)? Q6. (Chapter 12) Write the TREE-SUCCESSOR() procedure for a binary tree that supports pre-order walk.A:Answer:See a step by

Q:Question:product (GDP) in billions of dollars for all 50 states. The data are entered in alphabetic order by state (Source: Bureau of Economic Analysis). a. Calculate the mean and median for these data. Are these values of the mean and the median sample statistics or populatio parameters? ?= billion Median = billion These values of the mean and

Q:Question:Let Y1 < Y2 < Y3 < Y4 < Y5 be the order statistics of a random sample of size 5 from a continuous distribution with median m. What is P(Y2 < m < Y4)?

Q:Question:Assuming f(n) and g(n) are asymptotically positive functions use the definition of asymptotic notation to prove if f(n)=O(g(n) then g(n)=?(f(n)).A:Answer:See a step by step answer

Q:Question:A- Iteration method, then express the result in asymptotic notation Big-O. \[ T(n)=n+2 T(n / 2) \] B- Master method, then express the result in asymptotic notation \( \Theta \). \[ T(n)=8 T(n / 2)+3 n^{2} \]A:Answer:A) T(n)= 2T(n/2) + n -----------------equation 1. ...

Q:Question:(20 Points) Use the formal definition of the asymptotic notation to prove that: 30 n^2+100 ??(n^3)A:Answer:See a step by step answer

Q:Question:A- Iteration method, then express the result in asymptotic notation \( \Theta \). \[ T(n)=n+2 T(n / 2) \] B- Master method, then express the result in asymptotic notation \( \Theta \). \[ T(n)=8 T(n / 2)+n^{2}+10 n \]A:Answer:A- I) Below image represents the solution using tr...

Q:Question:Please explain what each of the 3 asymptotic notations are used forA:Answer:See a step by step answer

Q:Question:A- Iteration method, then express the result in asymptotic notation \( \Theta \). \[ T(n)=n+2 T(n / 2) \] B- Master method, then express the result in asymptotic notation \( \Theta \). \[ T(n)=8 T(n / 2)+n^{2}+10 n \]A:Answer:A] ITERATIVE METHOD (RECURSSION METHOD) For k=1, T...

Q:Question:3A. Crossover Point Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 6 n^2 steps, while merge sort runs in 60nlgn steps. For which values of n does insertion sort beat merge sort? (5 points) Answer 2 ? n ? 58A:Answer:See a step by step answer

Q:Question:Thank you for help with this Discrete math Suppose we are comparing implementation of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort runs in 64n log2 n steps. For which values of n does insertion sort beat merge sort?A:Answer:See a step by step answer

Q:Question:Suppose we are comparing implementation of insertion sort and merge sort on the same machine. For input size n, insertion sort runs in 8 n^2 steps, while merge sort runs in 64 n l g(n) steps. For which value of n does insertion sort beat (better than) merge sort? [ n ? 55; n ? 55; n ? 43; n ? 43 ]A:Answer:See a step by step answer

Q:Question:Write each number in standard notation 0.9??10^(-1)A:Answer:See a step by step answer

Q:Question:For the input size of n, insertion sort runs in 2n2 steps while merge sort runs in 8nlogn steps. For which values of n does insertion sort beat merge sort?A:Answer:See a step by step answer

Q:Question:\[ 2,1,6,9,4,3,8 \] b. What is the worst case computing time for selection sort? 2. Heapsort a. Show All iterations of the insert algorithm to buld a heap on the list \( 2,1,6,9,4,3,8 \) b. Show Alliterations of the heapify algorithm to build a heap on the list \( 2,1,6,9,4,3,8 \) c. Show ALL iteratioes of the heapsort algorithm to sort

Q:Question:Type the answer please! Thank you! Conceptual /r/n 6.8 Heapsort vs. Quicksort The worst-case time complexity of heapsort is ?(n n), whereas for quicksort, it is ?(n^2). Why, then, is quicksort preferred over heapsort in practice?A:Answer:The following reasons make quicksort more preferab...

Q:Question:Write the details algorithm and convert into java code for the solution of Dijkstra's Algorithm (Implement Dijkstra's algorithm using an adjacency matrix) The text implements Dijkstra's algorithm using lists for adjacent edges. Implement the algorithm using an adjacency matrix for weighted graphs. Strategies to be used: - Dijkstra's

Q:Question:Recursion Tree method, then express the result in asymptotic notation ? (draw a tree) T(n) = 4T(n/2) + n2A:Answer:See a step by step answer

Q:Question:1 point Convert the following number from scientific notation to standard notation 6.750??10^(2)A:Answer:See a step by step answer

Q:Question:5. (20 Points) Use the formal definition of the asymptotic notation to prove that: 30 n^2+100 ??(n^3)A:Answer:See a step by step answer

Q:Question:1. We can express insertion sort as a recursive procedure. Please write the pseudo-code for insertion sort in a recursive fashion and provide the recurrence of the running time.A:Answer:See a step by step answer

Q:Question:4) a) Write code (or pseudocode) of the insertion sort algorithm analyze the computational complexity of it? Calculate the best, worst and average complexity of insertion sort algorithm? Show the steps of your solution. b )Sort the following list in alphabetical order using insertion sort algorithm? Show all the steps of your solution?

Q:Question:Write the number in standard notation 3.2??10^(-2)A:Answer:See a step by step answer

Q:Question:Express each number in standard notation (5.3??10^(2))(4.1??10^(5))A:Answer:See a step by step answer

Q:Question:Write each numeral in scientific notation and perform the operations. Give the answer in scientific notation and in standard notation. (640,000)(2,700,000)/120,000 scientific notation standard notationA:Answer:See a step by step answer

Q:Question:The answer is 58 please explain it steps by step 3A. Crossover Point Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 6 n^2 steps, while merge sort runs in 60nlgn steps. For which values of n does insertion sort beat merge sort? (5 points) Answer

Q:Question:Solve the following recurrence using: A- Iteration method, then express the result in asymptotic notation Big-O. \[ T(n)=n+2 T(n / 2) \] B- Master method, then express the result in asymptotic notation \( \Theta \). \[ T(n)=8 T(n / 2)+3 n^{2} \]

Q:Question:input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x) = x mod 10, show the resulting: a. Separate Chaining hash table b. Hash Table using linear probing c. Hash table using quadratic probing d. Hash table with second (Double Hashing) hash function h2(x) = 7 ?? ( x mod 7) 2. Show the results of rehashing the hash

Q:Question:3. Radix Sort Perform a radix sort of the following list of numbers, using a radix of 10 , into ascending order:Show the bin/bucket 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 Second Pass Third PassA:Answer:Answer First Pass 0 1 2

Q:Question: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 please provide the correct working code and algorithm for this and also provide

Q:Question:b. [6 points) Explain why the worst-case running time for bucket sort is ?(n^2). What simple change to the algorithm preserve its linear average-case running time and makes its worst-case running time O(n log n) ?A:Answer:See a step by step answer

Q:Question:A small chemical company that produces an epoxy resin expects its production volume to decline exponentially according to the relationship yt=5e-0.25t where yt is the production rate at time t. Simultaneously, the unit price is expected to increase linearly over time at the rate of ut=55(1+0.09t). What is the expression for the present

Q:Question:C++ Swap two adjacent elements by adjusting only the links (and not the data) using a. singly linked lists b. doubly linked listsA:Answer:solution:- (a) Suppose that BeforeP points to the ...

Q:Question:Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in 32nlogn steps. For which values of n does insertion sort beat merge sort? Group of answer choices: 1. n < 1024 2. n > 1024 3. n < 16 4. n > 16 5. Merge sort is

Q:Question:4. (10 points) What is the worst case running time for the bucket-sort algorithm given in the book? What simple change to the algorithm preserves its linear expected time and makes its worse-case running time O(n log _2 n). Support your answer.

Q:Question:Thanks 4. (10 points) What is the worst case running time for the bucket-sort algorithm given in the book? What simple change to the algorithm preserves its linear expected time and makes its worse-case running time O(n log _2 n). Support your answer.A:Answer:Bucket sort assumes that the input is drawn from a...

Q:Question:Is the rooted tree in Exercise 4 a full \( m \)-ary tree for some positive integer \( m \) ?What is the level of each vertex of the rooted tree in Exercise 4?A:Answer:The rooted tree is not a full m-ary tree for some ...

Q:Question:according to the simple linear regression model with equation y=5.00-0.01 x. a.What is the expected change in reaction time for a 1^?F increase in temperature? b. What is the expected reaction time when the temperature is 240^?F ? Answer 1: The reaction time should increase by .01 seconds. /r/n a.What is the expected change in reaction

Q:Question:answer this question using Java code. 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) Bubble sort b) Selection sort c) Binary search d) Linear searchA:Answer:See a step by

Q:Question:Swap two adjacent elements by adjusting only the links (and not the data) using a. singly linked lists b. doubly linked listsA:Answer:(a) Sample data structure for the list in C++ lang...

Q:Question:3. [3 points] Explain why the worst-case running time for bucket sort is ?(n^2). What simple change to the algorithm preserves its linear average-case running time and makes its worst-case running time O(n n) ?

Q:Question:Draw the rooted tree with root \\( g \\) and \\( c \\).A:Answer:See a step by step answer

Q:Question:a) Write code (or pseudocode) of the bubble sort algorithm and analyze the computational complexity of it? Calculate the best, worst and average complexity of bubble sort algorithm? Show the steps of your solution.A:Answer:See a step by step answer

Q:Question:Under what circumstance does the Quicksort performance get poor? Briefly explain why the Quicksort slows down so much under this circumstance. Thanks for the help!A:Answer:See a step by step answer

Q:Question:What we took in class: Chap5: Introduction to Structured Data and Classes. Outline: Structures Unions Enumerations Procedural and Object Oriented Programming Introduction to Classes. Chap6: Pointers. Outline: Pointer Variable Declarations Pointer Operators Pass-by-reference with Pointers Built-in Arrays Pointer Expressions and Pointer

Q:Question:A- Iteration method, then express the result in asymptotic notation Big-O. T(n)=n+T(n / 2) B- Master method, then express the result in asymptotic notation ?. T(n)=? T(n / 2)+n^3+50 n^2A:Answer:1)T(n) = n + T(n/2)T(n)= T(n/2) + n= T(n/4) + ...

Q:Question:Recursion Tree method, then express the result in asymptotic notation ?. T(n) = 4T(n/2) + n2A:Answer:See a step by step answer

Q:Question:vertex 1 to vertex 5 of length either 1 edge or 2 edges or 3 edges or 4 edges? a) 2 b) 3 c) 4 d) 5 /r/n Odd man out: - Topological sort Algorithm - DFS Algorithm - Binary search Algorithm - BFS Algorithm - Prim's Algorithm a) Binary search Algorithm b) BFS Algorithm c) Prim's Algorithm d) Topological sort AlgorithmA:Answer:See a step by

Q:Question:3. (Chapter 2) Suppose we are comparing the implementations of insertion sort and merge sort on the same machine (You don't need to know the algorithm to do this problem!). For inputs of size n, insertion sort runs in 8 n^? 2, while merge sort runs in 64 n ngn steps. For which values of ???? does insertion sort beat merge

Q:Question:Express each number in standard notation 1.243*10^(-7)A:Answer:See a step by step answer

In Chapter 1 - The technical and Social History of Software Engineering, six inventions are discussed that are related to each other and software engineering. They are: a. Mathematics, recording of ideas and information, calculating devices, channels for distributing information, software, enabling systems b. Mathematics, architecture, calculating

1. Review the rubric to make sure you understand the criteria for earning your grade. 2. Read Chapters 1 and 2 in your textbook. 3. Using the discussian link below, respond to the following prompts a. Describe the definition of an enterprise information system. b. Using your workplace or conducting research on the internet to identify a Fortune
image text in transcribed

Prerequisites In this assignment you will implement the Naive Bayes Classifier. Before starting this assignment, make sure you understand the concepts discussed in the videos in Week 2 about Naive Bayes. You can also find it useful to read Chapter 1 of the textbook. Also, make sure that you are familiar with the numpy.ndarray class of python's

Do Homework Chapter 1.1 Ho X P Do Homework Chapter 1 Less comStudentPlayerHomework.aspxhomeworkId668280558questionId1flushedfalsecid7741105backhttpsm... P Learning Numbers i... ath I) (MATH135032701) omework Question 1, 1.1.A4 Keanna Nobles 01 HW Score 0, 0 of 12 points Points 0 of 1 Cookies are sold singly or in packages of 12 or 36. With
image text in transcribed

Select the three accurate statements reflecting the business advantages of a relational database. Multiple select question. Increased data security Increased data redundancy Reduced data redundancy Increased data integrity Reduced flexibility Reduced data integrity

What industrial target (industry, busineChapter 7 in the book identifies targets, and attack methods. In chapter 7 "Attack Targets" (Table 7.2, page 175) select three targets identifying what control(s) is required to protect each target from each attack vector and possible attack methods. Identify where in the system you would deploy the control

In Chapter 3 the word"Trust" is defined as related to information security. Based on your understanding of securing your environment,what are some of the common safeguards your recommend to ensure trust is viable in your organization.

Select three features of a neural network. Multiple select question. Displays a hot list of key performance indicators Learning and adjusting to new circumstances on their own Coping with huge volumes of information with many dependent variables Lending themselves to massive parallel processing

In chapter 7 "Attack Targets" (Table 7.2, page 175) select three targets identifying what control(s) is required to protect each target from each attack vector and possible attack methods. Identify where in the system you would deploy the control and how it is or is not part of "defense in depth". Attack identification requires 1) detection, 2)

MEDICATION Morphine Sulphate CATEGORY CLASS PURPOSE OF MEDICATION Expected Pharmacological Action Therapeutic Use Complications ContraindicationsPrecautions Interactions Evaluation of Medication Effectiveness ACTIVE LEARNING TEMPLATES REVIEW MODULE CHAPTER Medication Administration Nursing Interventions Client Education
image text in transcribed

the data processing cycle - data input, processing, storage, and output - was introduced in this chapter. In the future, do you see any of these activities being deleted or additional activities being added? If so, what changes do you foresee? Do you foresee any changes to the way these four activities are implemented or handled? If so, how? If

Where should all unsterile items be placed when creating a sterile field? Multiple select question. Inside the sterile field Outside the sterile field Arranged on a counter or stand away from the sterile field Anywhere close enough for the doctor to reach

Select the three accurate statements reflecting the business advantages of a relational database. Multiple select question. Increased data integrity Reduced data integrity Reduced flexibility Increased data security Reduced data redundancy Increased data redundancy

Chapter 8 in the book and NIST SP800-82 contain the process for conducting a vulnerability and risk assessment. This module, consider the following scenario. You work as a security analyst for Bellevue Public Power District (BPPD). You've been tasked with conducting a vulnerability and risk assessment for their Industrial Control Systems. Before

Chapter 1: 3. Calculate the total time required to transfer a 1000-KB file in the following cases, assuming an RTT of 50 ms, a packet size of 1 KB data, and an initial 2 RTT of "handshaking" before data is sent: (a) The bandwidth is 1.5 Mbps, and data packets can be sent continuously. (b) The bandwidth is 1.5 Mbps, but after we finish sending each

Objectives: 1. Become familiar with highway geometric design concepts; and 2. Apply highway design theories (Chapters 2 through 3) to solve simple real-world problems. Description: Your team is tasked with designing a basic horizontal and vertical alignment for a curved-ramp providing access from a surface street to a northbound bridge crossing of

To obtain the uniform stress distribution for the loading shown, select the correct statements from the following choices. Multiple select question. The plates cannot be rigidly attached to the member. The actual loading and the loading used to compute the stresses must be statically equivalent. Stresses cannot be computed in the immediate

Create a Chap03\Projects folder under your work folder. Then copy the data files from the downloads section for this chapter (on the student companion site for this book) to this work subfolder. If necessary, extract any compressed files to this subfolder

Post your thoughtful analysis about one key point you took from this assigned reading. NIST 800 100 Information Security Handbook Chapter 8

ow are large and small police departments similar? How are they different? The purpose of this assignment is to have the student list the similarities and differences between large and small police departments and compare them. The student should be sure to incorporate and cover: The chain of command Major operating units within police departments

Consider the negotiated bit rates explained toward the end of the chapter. Is it possible to truly provide a constant bit rate in a packet switched network? Does your answer depend on the network conditions? If so, what conditions would impact the answer to the

Where are the choices for the 7th character encounter type found in the Code Book? In the Coding Guidelines In the Chapter Specific Guidelines In the AlpWhat is the fastest way to find a code for cancer in a Code Book? The Alphabetic Index The Neoplasm Table Use the Chapter Specific Guidelines Go directly to the Tabular List Question 4habetic

Why is it important to unfold an instrument package so carefully? Multiple select question. Touching the inside of the pack will contaminate the sterile field So the instruments can be arranged properly So you don't reach across the instruments So you don't touch the instruments

Then, based on the steps to solve a problem, do written assignment in which you answer each of the following questions in a minimum of five to six complete sentences. Your answers must be based on reading the chapter or on other reliable sources of information that you have consulted. At the end of your work you must include references in style.

Section 1 You're investigating an internal policy violation when you find an e-mail about a serious assault for which a police report needs to be filed. What should you do? compose a report specifying who in your company you need to talk to first and what evidence must be turned over to the police. Cite your source for references. Section 2 An

Where should all unsterile items be placed when creating a sterile field? Multiple select question. Inside the sterile field Arranged on a counter or stand away from the sterile field Outside the sterile field Anywhere close enough for the doctor to reach

Chapter 4: 1. Compare the characteristics of a CPU-bound process versus an I/O-bound process. 2. Name three examples of I/O devices that cannot be shared. 3. Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A 52 ms, Job B 512 ms, Job C 515 ms, Job D 57 ms, and Job E 5 3 ms. a. Using FCFS,

What are some important things to remember when adding instruments and supplies into a sterile field? Multiple select question. Wash your hands and then carefully place and arrange the items on the field. Reach across the items to place them where you want them. Stand away from the sterile field when opening sterile instrument packs. The outer 1

What are some important things to remember when adding instruments and supplies into a sterile field? Multiple select question. Reach across the items to place them where you want them. Wash your hands and then carefully place and arrange the items on the field. The outer 1 inch of the field is considered contaminated. Stand away from the sterile

An insurance company accepts an application containing several unanswered questions and issues the policy. In this situation, the company OA. must obtain the missing information at a future date B. must honor the policy as issued C. may restrict the producers commission on the policy OD. may restrict the Owners Rights clause
image text in transcribed

Which of these are good ways to organize new emails in your inbox? Multiple select question. Place emails related to all of your classes in the education folder. Move emails that have been addressed but that should be kept to provide a record to the archive folder. Use a to-do folder for emails requiring an action to be taken. Create a folder for

Appendix B: Networks & Telecommunications - Module SummaryOverview Appendix B discusses networks and telecommunications, which entail the transmission of signals over a distance for communication purposes. In contemporary settings, this typically involves electronic transmitters emitting electromagnetic waves. In earlier times, methods such as

In Chapter 2, we will look at the regulation of wireless. The ITU regulates the global frequency spectrum, and locally, the FCC regulates it in the US. Research these two agencies and determine how wireless communication's frequency spectrum is divided. Research the scope of the ISM and the UNII licensing bands within the US and investigate if

Appendix A: Hardware & Software Basics - Module SummaryOverview Appendix A provides an overview of the importance of learning technical architecture, emphasizing its role in equipping individuals with essential knowledge and skills for effective software system design. This understanding enables the prioritization of system requirements, fostering

Using the following guidelines, create a python program. 1. You will be using the CPT180Stuff folder from Chapter 9 Assignment 1 for this assignment. 3. Add four comment lines at the top of the program that contain: a. Program Name b. Program Description c. Programmer's Name (You) d. Current Date 4. Write code that will do the following: a. Using

From Chapter 3 Artificial-Earth satellites fly at different altitudes, depending on their needs. Describe the differences between low-Earth satellites, medium-Earth satellites, and geosynchronous satellites. For which applications would you use each? Your initial response (250-300 words) is due by Thursday night at midnight, with two responses

The National Institute of Standards and Technology of the U.S. Department of Commerce has a special publications series on IT security. The webpage listing these 800 series publication ishttp://csrc.nist.gov/publications/PubsSPs.html. Read Special Publication 800-123, Guide to General Server Security . List recommendations that are in the

Question 3 (6 points) Purpose To reflect on the work of programming for Question 2. Degree of Difficulty Easy. Textbook Chapter 3 Restrictions This question is homework assigned to students and will be graded. This question shall not be distributed to any person except by the instructors of CMPT 145. Solutions will be made available to students
image text in transcribed

The class will discuss Chapter 3 using the round robin method

Part B: Category vs. function (intermediate) [11 points] The -ly adverbs (adjective type modificational items in non-adjective positions) are just one type of item that has an adverbial function. The semantic function of an adverb (as opposed to its syntactic category) is to give additional information about a verb, a clause, a preposition, an

1.) Discuss the challenges a business may face if they implement the features of Crime Prevention Through Environmental Design (CPTED) as noted in Chapter 1 of the text. 2.) In December 2017, Atlanta's Hartsfield-Jackson Airport, the nation's busiest by volume, suffered a power failure for a period of 11 hours. Thousands of flights were disrupted

Showing 200 - 300 of 335
  • 3 / 4