$(14$ points$)$ Assume we have a program named bigbrother, whose output format is as follows:

username login$\_$time $=>$ logout$\_$time minutes$\_$on

If a user hasn$$t logged out, the logout$\_$time is set to $$none$.$ Times are otherwise in $24-$hour

format. The program resets every day at midnight; if someone logged in at $11$:$30$pm$,$ then at

$12$:$01$am it would say that they logged in at $12$:$00,$ and had been on for $1$ minute.

Here is some sample output, assuming you$$ve run the command at $11$:$30$pm:

bart $23$:$20=>$ none $10$

homer $10$:$15=>10$:$183$

homer $10$:$20=>10$:$3010$

smithers $7$:$45=>22$:$01856$

smithers $11$:$15=>12$:$2772$

Bart logged on $10$ minutes ago, and is still on$.$ Homer logged in at $10$:$15$am for three minutes,

and later logged in at $10$:$20$am for $10$ minutes. Smithers was logged in most of the day in one

window, and also opened a second window for just over an hour.

Note that: $(1)$ the program uses groups of spaces, sometimes more, sometimes fewer, so the

output is in neat columns. $($There are no tabs in the output.$),$ and $(2)$ the output is sorted by

username for everyone who logged on today in the order they logged in$.$

Write shell commands that begin with bigbrother $|$ and generate the following output:

$($a$)($two points$)$ Show the full lines for the ten longest login sessions of the day.