Develop a program that, given a sequence S of integers as input, produces as output two sequences of positive integers, the first of which indicates all those positions in S at which S's minimum value occurs and the second of which indicates all those positions at which S's maximum value occurs. Positions are numbered starting at zero (0).
Please code in java and follow the instructions as it is.. Dont use very advanced methods. Refer the images provided for the scope and sample input and output
Develop a program that, given a sequence S of integers as input, produces as output two sequences of positive integers, the first of which indicates all those positions in S at which S's minimum value occurs and the second of which indicates all those positions at which S's maximum value occurs. Positions are numbered starting at zero (0).
Facts
Scanner has a method that returns a boolean indicating whether a next integer exists in its input stream ( hasNextInt () )
• Scanner objects can be initialized to to scan String data as input.
Input
The input will begin with a single line containing T, the number of test cases to follow. The remaining lines contain the T sequences, one line per sequence. Each of these lines contains the values in the sequence. Each such value is separated from the next by at least one space.
Output
For each sequence given as input, there should be four lines of output. The first line echos the given sequence. The second line indicates the positions at which the minimum value occurs.
The third line indicates the positions at which the maximum value occurs. The fourth line is blank.
![Sample Input
3
36-14653
0000
-4 45 2 0 3 5 11 -7 854 25 3-74-3
Sample Output
36-1465 3
2
14
0000
0123
0123
-4 45 2 0 3 5 11 -7 854 25 3-74-3
711
8](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Feb1193c9-d0d1-416d-ac45-bceed8a4dd09%2Fef151881-de36-41d1-b86c-1f940fe73c72%2F0tat66_processed.jpeg&w=3840&q=75)
![P1 Concepts
P2 Solutions limited in scope to:
Selection statements
O
O
O
single selection
double selection
multi-selection
Repetition statements
O
counter controlled loops
sentinel controlled loops](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Feb1193c9-d0d1-416d-ac45-bceed8a4dd09%2Fef151881-de36-41d1-b86c-1f940fe73c72%2F8tppwuq_processed.jpeg&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)