Question $1-$ Black Box Testing $(27$ marks$)$

You are to plan black box testing for a program that searches for phone extensions in a company. A screen shot of the program is provided below.

DO NOT WORRY ABOUT BOUNDARY TESTING FOR THIS QUESTION. ASSUME THE PROGRAM CAN HANDLE LARGE STRINGS AND YOU DO NOT HAVE TO TEST IT$.$

There are $3$ inputs and two buttons:

$-$ First Name$-$A string

$-$ Last Name $-$A string

$-$ Phone Number $-$ A string

$-$ Search Button $-$ performs the search and displays the possible phone extensions

$-$ Clear Button $-$ Clears both the search results and the three textboxes.

Other Details

$-$ The user must input at least two of the three text boxes before pressing the search button.

$-$ They can enter up to all three pieces of data $($first name, last name and phone number$)$ for a search.

$-$ The result returned is a list of possible employees and the department they belong to

Record your test cases in the table below. You may add more rows as required. Do not add duplicate test cases.

DO NOT WORRY ABOUT BOUNDARY TESTING FOR THIS QUESTION. ASSUME THE PROGRAM CAN HANDLE LARGE STRINGS AND YOU DO NOT HAVE TO TEST IT$.$