Sorting networks are an interesting class of parallel sorting algorithms with applications in multi-processor computers and switching networks. Construct a sorting network with 7 wires.

This is the illustration for the execution of the insertion-sort algorithm on the input sequence (12, 11, 13, 5, 6): look the picture sent Group of answer choices a) True b) False

A given implementation of bubble-sort takes on average 1 second to sort an array of 1000 elements. How many seconds do you expect sorting an array of 8000 elements will take? A given implementation of quicksort takes on average 0.1 seconds to sort an array of 1000 elements. How many seconds do you expect sorting an array of 8000 elements will take?

A Queen on a chessboard can attack any piece in the same column, row or diagonal. The N-Queens problem is to place n queens on an x n chessboard such that no two queens threaten each other. a) Implement a one-dimensional integer array of Queen positions for an 8x8 board where indices represent rows and the values represent columns. For example, a "safe" solution would be (3,6,2, 7, 1, 4, 0,5} b) Implement a print function to display the board (see output example) c) Implement an isSafe function that: 1) Returns false if multiple queens share a column 2) Returns false if multiple queens share a diagonal 3) Returns true if all queens are safe d) Program should display if the Queens are safe or not safe. Example Output Testing: 1 4 2 3 5 7 60 Queens are not safe!