A particular function takes a positive integer parameter n andperforms exactly 3n+2n* log(n) + 50log(n)+1000 steps beforereturning. What is its run-time complexity?
O(log n)
O(n)
O(n^2)
O(n logn)
O(1)
for the array {7, 4, 9, 2, 6, 3}, using the following sortingalgorithm to run it. Write the value in the array for eachpass.
a.Bubble sort algorithm (5 pts)
b.Selection sort algorithm (5 pts)
For the infix expression 2+(3+5-2*4), show step by step tochange it into a postfix expression using a stack, you need to showthe contents of the stack and the output expression. (suppose theleft side is the bottom of the stack, and the left
PayPal Gateway not configured
PayPal Gateway not configured